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
Today is a major holiday in the US, Labor Day. The...
Great Books: Computers and Intractability: A Guide...
Complexity Class of the Week: S2P
Complexity Class of the Week When I was at U. Chi...
Last spring, I saw Copenhagen, a great play about ...
This has been an exciting summer for computational...
This is my complexity web log. I'll be giving rand...
IEEE Conference on Computational Complexity
Electronic Colloquium on Computational Complexity
BEATCS Computational Complexity Column
Complexity Zoo
Favorite Complexity Books
Abie Flaxman
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 Today's New York Times has an essay on primes and the new AKS algorithm. A bit rambling but worth a look. 5:30 AM # 0 comments
Posted by Lance
5:30 AM # 0 comments
Comment Feeds: This Post All
Create a Link