Theoretical Computer Science
Meta user
Network profile
7,606
reputation
37
55

Lance Fortnow

Apparently, this user prefers to keep an air of mystery about them.

45
answers
4
questions
~160k
people reached
  • Atlanta, GA
  • lance.fortnow.com
  • Member for 8 years, 10 months
  • 1,244 profile views
  • Last seen Jul 14 at 11:48

Communities (2)

Top network posts

We respect a laser-like focus on one topic.

Top tags (53)

Score 571
Posts 38
Posts % 78
Score 176
Posts 17
Score 112
Posts 5
Score 93
Posts 5
Score 73
Posts 4
Score 53
Posts 3
View all tags →

Top posts (49) All Questions Answers | Votes Newest

52 Single author papers against my advisor's will? Apr 12
50 Why do we consider log-space as a model of efficient computation (instead of polylog-space) ? Dec 2 '10
36 Are $PSPACE$-complete problems inherently less tractable than $NP$-complete problems? Mar 8 '11
33 What is the Volume of Information? Sep 23 '10
31 Are there “NP-Intermediate-Complete” problems? Jan 28 '14
30 Derandomizing Valiant-Vazirani? Jul 29 '11
26 Is there an oracle such that SAT is not infinitely often in sub-exponential time? Feb 24 '15
23 Is $PH \subseteq PP$? Nov 23 '10
20 Coloring Planar Graphs Dec 30 '10
19 Proofs that expose a deeper structure Nov 19 '10
View all questions and answers →

Badges (92)

Gold

—

Silver

37

Rarest

Bronze

55

Rarest

View all badges →