Episode #125 of the Stack Overflow podcast is here. We talk Tilde Club and mechanical keyboards. Listen now
Theoretical Computer Science
Network profile
601
reputation
4
5

Paul Beame
Unregistered

Apparently, this user prefers to keep an air of mystery about them.

5
answers
0
questions
~7k
people reached
  • Member for 9 years, 1 month
  • 99 profile views
  • Last seen Oct 7 '13 at 19:57

Communities (1)

Top network posts

We respect a laser-like focus on one topic.

Top tags (8)

Score 39
Posts 4
Posts % 80
Score 18
Posts 1
Score 18
Posts 1
Score 16
Posts 1
Score 16
Posts 1
Score 12
Posts 1
View all tags →

Top posts (5) All Questions Answers | Votes Newest

18 Overarching reasons why problems are in P or BPP Oct 3 '13
16 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

Badges (9)

Gold

—

Silver

4

Rarest

Bronze

5

Rarest

View all badges →