Skip to main content
Theoretical Computer Science
Lance Fortnow's user avatar
Lance Fortnow's user avatar
Lance Fortnow's user avatar
Lance Fortnow
  • Member for 14 years
  • Last seen more than a week ago
Profile Activity
Stats
8,741
reputation
186k
reached
49
answers
4
questions
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
45
silver badges
59
bronze badges
Top tags
View all tags
621
Score
41
Posts
77
Posts %
193
Score
19
Posts
36
Posts %
125
Score
5
Posts
9
Posts %
95
Score
5
Posts
9
Posts %
79
Score
4
Posts
8
Posts %
53
Score
3
Posts
6
Posts %
Top posts
View all questions and answers
answer
64
Single author papers against my advisor's will?
Apr 12, 2019
answer
60
Why do we consider log-space as a model of efficient computation (instead of polylog-space) ?
Dec 2, 2010
answer
36
Are $PSPACE$-complete problems inherently less tractable than $NP$-complete problems?
Mar 8, 2011
question
36
What is the Volume of Information?
Sep 23, 2010
answer
34
Are there "NP-Intermediate-Complete" problems?
Jan 28, 2014
answer
32
Derandomizing Valiant-Vazirani?
Jul 29, 2011
answer
26
Is there an oracle such that SAT is not infinitely often in sub-exponential time?
Feb 24, 2015
answer
23
Is $PH \subseteq PP$?
Nov 23, 2010
question
21
Coloring Planar Graphs
Dec 30, 2010
answer
20
Circuits with oracles vs. Turing Machines with oracles
Aug 25, 2010