Theoretical Computer Science
Network profile
1,311
reputation
10
8

Russell Impagliazzo

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

7
answers
0
questions
~8k
people reached
  • Member for 8 years, 11 months
  • 434 profile views
  • Last seen Nov 20 '17 at 20:26

Communities (1)

Top network posts

We respect a laser-like focus on one topic.

Top tags (14)

Score 121
Posts 6
Posts % 86
Score 30
Posts 1
Score 30
Posts 1
Score 28
Posts 1
Score 28
Posts 1
Score 28
Posts 1
View all tags →

Top posts (7) All Questions Answers | Votes Newest

30 Why do equalities between complexity classes translate upwards and not downwards? Oct 25 '10
28 Hierarchy theorem for circuit size Feb 24 '11
17 MIP with efficient provers Aug 28 '10
16 Is there an oracle such that SAT is not infinitely often in sub-exponential time? Feb 26 '15
16 How fast would a nondeterministic algorithm for an EXPTIME-complete problem have to be to imply $P \neq NP$? Mar 15 '15
14 Ways for a mathematician to stay informed of current research in complexity theory Jan 5 '11
7 For a random oracle R, does BPP equal the set of computable languages in P^R? Oct 9 '14

Badges (18)

Gold

—

Silver

10

Rarest

Bronze

8

Rarest

View all badges →