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
Ketan Mulmuley and Milind Sohoni have an interesti...
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...
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 I'm off to beautiful Banff, Canada for the MSRI Workshop on Quantum Algorithms and Complexity. So no regular features this week but I hope to bring you the latest in quantum computation. 6:13 AM # 0 comments
Posted by Lance
6:13 AM # 0 comments
Comment Feeds: This Post All
Create a Link