Theoretical Computer Science
Paul Beame
Unregistered
  • Member for 11 years
Profile Activity
Stats
621
reputation
7k
reached
5
answers
0
questions
About
Apparently, this user prefers to keep an air of mystery about them.

Communities (1)

Top network posts

We respect a laser-like focus on one topic.

This user doesn’t have any gold badges yet.
4
silver badges
5
bronze badges
View all badges

Top tags (8)

Score 40
Posts 4
Posts % 80
Score 19
Posts 1
Score 19
Posts 1
Score 17
Posts 1
Score 17
Posts 1
Score 12
Posts 1
View all tags →

Top posts (5)

All Questions Answers
Votes Newest
19 Overarching reasons why problems are in P or BPP Oct 3 '13
17 Best known deterministic time complexity lower bound for a natural problem in NP May 13 '13
12 Problems between NC and P: How many have been resolved from this list? Sep 18 '10
10 Complexity lower bound: the gap between decision trees and RAMs Jan 30 '11
1 Complexity lower bound: the gap between decision trees and RAMs Jan 30 '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.