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
Our Friends at the NSA
A Physics-Free Introduction to the Quantum Computa...
Foundations of Complexity Lesson 13: Satisfiabilit...
What is your Erdös number?
Circuits over Sets of Natural Numbers
When will we show P ≠ NP?
Logic in the 21st Century
Foundations of Complexity Lesson 12: Turing Machin...
2003: A Year-Long Celebration of Geniuses
Reflections on 2002
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.
Supreme Court Rules on Infinity Posted by Lance Breaking news on a post from last October. The US Supreme Court ruled in favor of Disney that ever increasingly long finite lengths of copyright protection does not violate the constitutional prohibition against indefinite copyrights. 10:25 AM # 0 comments
Posted by Lance
10:25 AM # 0 comments
Comment Feeds: This Post All
Create a Link