/explore
|
You are here 
|
blog.computationalcomplexity.org | ||
| | | | |
thmatters.wordpress.com
The Computational Complexity Blog - complexity theory, Lance Fortnow Ernie's 3D Pancakes - algorithms, geometry, Jeff Erikson Vanity of Vanities, all is Vanity - algorithms,... |
|
| | | | | ||
| | | | |
live-simons-blog.pantheonsite.io
|
|
| | | | | ||
| | | | |
windowsontheory.org
The theoretical computer science community and science at large suffered a great tragedy today. Luca Trevisan has been one of my intellectual and personal heroes since I joined the field. His work on pseudorandomness, complexity, cryptography and algorithms has been a strong influence on my work. Whenever I wanted to understand a new topic, often... |
|
| | | | | ||
| | | | |
www.jeremykun.com
Define the Ramsey number $ R(k,m)$ to be the minimum number $ n$ of vertices required of the complete graph $ K_n$ so that for any two-coloring (red, blue) of the edges of $ K_n$ one of two things will happen: There is a red $ k$-clique; that is, a complete subgraph of $ k$ vertices for which all edges are red. There is a blue $ m$-clique. It is known that these numbers are always finite, but it is very difficult to compute them exactly. |
|
| | | |||
