This is my complexity web log. I'll be giving random thoughts about computational complexity and about mathematics and computer science in general.Ten years and over two thousand posts later this blog keeps going.
Computational Complexity has come a long way since 2002. In post two I talked about the then new result showing that Primes are in P. Since then we've seen Reingold's log-space algorithm for undirected connectivity, Dinur's "simpler" proof of the PCP theorems, new circuit lower bounds and great new algorithms. Alas the P versus NP problem is still open.
Thanks to all of you for reading and commenting on the blog. It's your support that has keeps us going for the the last ten years and many more years to come.