Theoretical Computer Science
Meta user
Network profile
8,201
reputation
39
55

Lance Fortnow

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

46
answers
4
questions
~164k
people reached
  • Chicago, IL, USA
  • lance.fortnow.com
  • Member for 9 years, 5 months
  • 1,275 profile views
  • Last seen yesterday

Communities (2)

Top network posts

We respect a laser-like focus on one topic.

Top tags (54)

Score 579
Posts 39
Posts % 78
Score 182
Posts 18
Score 113
Posts 5
Score 93
Posts 5
Score 74
Posts 4
Score 53
Posts 3
View all tags →

Top posts (50) All Questions Answers | Votes Newest

60 Single author papers against my advisor's will? Apr 12 '19
51 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 Derandomizing Valiant-Vazirani? Jul 29 '11
31 Are there “NP-Intermediate-Complete” problems? Jan 28 '14
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
21 Coloring Planar Graphs Dec 30 '10
19 Proofs that expose a deeper structure Nov 19 '10
View all questions and answers →

Badges (94)

Gold

—

Silver

39

Rarest

Bronze

55

Rarest

View all badges →