User Paul Beame - Theoretical Computer Science Stack Exchange

Network profile

621

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 10 years, 8 months
101 profile views
Last seen Oct 7 '13 at 19:57

Communities (1)

Theoretical Computer Science 621 621 4 silver badges5 bronze badges

Top network posts

We respect a laser-like focus on one topic.

Top tags (8)

cc.complexity-theory

Score 40

Posts 4

Posts % 80

big-list

Score 19

Posts 1

big-picture

Score 19

Posts 1

p-vs-np

Score 17

Posts 1

np

Score 17

Posts 1

open-problem

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

Badges (9)

Gold

—

Silver

4

Rarest

Enlightened

Oct 5 '13
Yearling

× 3

Dec 25 '15

Bronze

5

Rarest

Teacher

Oct 3 '13
Nice Answer

× 4

Oct 5 '13

View all badges →

Theoretical Computer Science Stack Exchange works best with JavaScript enabled