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
Rush Hour
Cardinality Theorem for Regular Languages?
Howdy from Berlin
A Zero-One Law for RP
Complexity Papers Announced
More on Perfect Graphs
Complexity Class of the Week: BPPpath
News for Nerds. Stuff that Matters.
Traveling Salesman on the Plane
Foundations of Complexity Lesson 15: More NP-compl...
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.
Talk Posted Posted by Lance I posted the slides of my talk, "Church, Kolmogorov and von Neumann: Their Legacy Lives in Complexity" that I presented at the Dutch Theory Day last week, for those that are interested. 3:24 PM # 0 comments
Posted by Lance
3:24 PM # 0 comments
Comment Feeds: This Post All
Create a Link