Theoretical Computer Science
Profile Activity
Meta user
Network profile
8,371
reputation
40
55

Lance Fortnow

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

47
answers
4
questions
~171k
people reached
  • Chicago, IL, USA
  • lance.fortnow.com
  • Member for 10 years, 8 months
  • 1,353 profile views
  • Last seen Apr 27 at 21:30

Communities (2)

Top network posts

We respect a laser-like focus on one topic.

Top tags (55)

Score 591
Posts 39
Posts % 76
Score 185
Posts 19
Score 117
Posts 5
Score 94
Posts 5
Score 78
Posts 4
Score 53
Posts 3
View all tags →

Top posts (51)

All Questions Answers
Votes Newest
61 Single author papers against my advisor's will? Apr 12 '19
55 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
35 What is the Volume of Information? Sep 23 '10
32 Derandomizing Valiant-Vazirani? Jul 29 '11
32 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
20 Hierarchy for BPP vs derandomization May 27 '11
View all questions and answers →

Badges (95)

Gold

—

Silver

40

Rarest

Bronze

55

Rarest

View all badges →

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.