Theoretical Computer Science
Paul Beame's user avatar
Paul Beame's user avatar
Paul Beame's user avatar
Paul Beame
Unregistered
  • Member for 12 years
  • Last seen more than 8 years ago
Profile Activity
Stats
621
reputation
8k
reached
5
answers
0
questions
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
4
silver badges
5
bronze badges
Top tags
View all tags
40
Score
4
Posts
80
Posts %
19
Score
1
Posts
20
Posts %
19
Score
1
Posts
20
Posts %
17
Score
1
Posts
20
Posts %
17
Score
1
Posts
20
Posts %
12
Score
1
Posts
20
Posts %
Top posts
All Questions Answers
Score Newest
answer
19
Overarching reasons why problems are in P or BPP
Oct 3, 2013
answer
17
Best known deterministic time complexity lower bound for a natural problem in NP
May 13, 2013
answer
12
Problems between NC and P: How many have been resolved from this list?
Sep 18, 2010
answer
10
Complexity lower bound: the gap between decision trees and RAMs
Jan 30, 2011
answer
1
Complexity lower bound: the gap between decision trees and RAMs
Jan 30, 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.