Computational complexity and other fun stuff in math and computer science as viewed by Lance Fortnow and Bill Gasarch.
Bill's Home Page
Lance's Home Page
Weblog Home
Weblog Archives and Search
Podcast
Mailing List
Feeds: Posts Comments
Foundations of Complexity
Graduate Student Guide
Favorite Theorems
I saw Carl Pomerance yesterday give a wonderful pr...
Complexity Class of the Week: C=L
Foundations of ComplexityLesson 2: Computable and ...
Complexity Class of the Week: Factoring
Who says you can't make money with mathematics? He...
Science Screenplay Contest
On September 11, 2001 we lost a member of th...
Foundations of Complexity Lesson 1: What is a comp...
I heard of a nice new result from Russell Impaglia...
Complexity Class of the Week: PP
IEEE Conference on Computational Complexity
Electronic Colloquium on Computational Complexity
BEATCS Computational Complexity Column
Complexity Zoo
Favorite Complexity Books
Andy Drucker
Ars Mathematica
Computing Research Policy
D. Sivakumar
David Eppstein
David Molnar
David Pennock
Doron Zeilberger
Jeff Erickson
John Langford
Kurt Van Etten
Luca Aceto
Luca Trevisan
Michael Mitzenmacher
Muthu Muthukrishnan
Michael Nielsen
Paul Goldberg
Oded Goldreich
Scott Aaronson
Sorelle Friedler
Suresh Venkatasubramanian
Terence Tao
DMANET
FYI
Nielsen's Principles of Research
Parberry's TCS Guides
Theory Matters
Theorynet
Computer Science Theory
Theory Edge
This work is licensed under a Creative Commons License.
Posted by Lance Ketan Mulmuley and Milind Sohoni have an interesting approach to separating complexity classes using algebraic geometry. Ken Regan describes this approach for the common complexity theorist in the October BEATCS Computational Complexity Column. 3:48 PM #
Posted by Lance
3:48 PM #