Theoretical Computer Science
Lance Fortnow
  • Member for 11 years, 5 months
  • Last seen this week
Profile Activity
Stats
8,501
reputation
176k
reached
48
answers
4
questions
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
41
silver badges
56
bronze badges
Top tags
View all tags
603
Score
40
Posts
77
Posts %
187
Score
19
Posts
37
Posts %
118
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
Votes Newest
62
Single author papers against my advisor's will?
Apr 12 '19
56
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
33
Are there "NP-Intermediate-Complete" problems?
Jan 28 '14
32
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
21
Coloring Planar Graphs
Dec 30 '10
20
Hierarchy for BPP vs derandomization
May 27 '11

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.