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
More on the Tables Problem
Math Problems from everyday life
COMPUTATIONAL COMPLEXITY CONF 2008 SUBMISSIONS WEB...
Richard Beigel is at NSF
Resubmitting Rejected FOCS paper to STOC
It was a stupid question!!!!!!!!!! or...
Equations and Colorings: Rado's theorem
Do we root for how a problem will go?
Stoc seeking papers that...
THANKS to Nicole's FOCS blogs and her positive out...
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
Oded Goldreich
Scott Aaronson
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.
Advice about NSF grants (not from me) Posted by GASARCH How to get an NSF grant? If I knew I would have more Grant money. However, I was emailed the following powerpoint slides with the request to post them on my blog, so here they are 11:56 AM #
Posted by GASARCH
11:56 AM #