Theoretical Computer Science
Lance Fortnow's user avatar
Lance Fortnow's user avatar
Lance Fortnow's user avatar
Lance Fortnow
  • Member for 13 years, 3 months
  • Last seen more than a month ago
Profile Activity
Stats
8,616
reputation
183k
reached
48
answers
4
questions
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
44
silver badges
59
bronze badges
Top tags
View all tags
611
Score
40
Posts
77
Posts %
188
Score
19
Posts
37
Posts %
123
Score
5
Posts
10
Posts %
94
Score
5
Posts
10
Posts %
79
Score
4
Posts
8
Posts %
53
Score
3
Posts
6
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
64
Single author papers against my advisor's will?
Apr 12, 2019
answer
59
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
35
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
Hierarchy for BPP vs derandomization
May 27, 2011

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.