Theoretical Computer Science
Russell Impagliazzo's user avatar
Russell Impagliazzo's user avatar
Russell Impagliazzo's user avatar
Russell Impagliazzo
  • Member for 12 years, 1 month
  • Last seen more than 4 years ago
Profile Activity
Stats
1,321
reputation
10k
reached
7
answers
0
questions
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
10
silver badges
8
bronze badges
Top tags
View all tags
122
Score
6
Posts
86
Posts %
30
Score
1
Posts
14
Posts %
30
Score
1
Posts
14
Posts %
29
Score
1
Posts
14
Posts %
29
Score
1
Posts
14
Posts %
29
Score
1
Posts
14
Posts %
Top posts
All Questions Answers
Score Newest
answer
30
Why do equalities between complexity classes translate upwards and not downwards?
Oct 25, 2010
answer
29
Hierarchy theorem for circuit size
Feb 24, 2011
answer
17
MIP with efficient provers
Aug 28, 2010
answer
16
Is there an oracle such that SAT is not infinitely often in sub-exponential time?
Feb 26, 2015
answer
16
How fast would a nondeterministic algorithm for an EXPTIME-complete problem have to be to imply $P \neq NP$?
Mar 15, 2015
answer
14
Ways for a mathematician to stay informed of current research in complexity theory
Jan 5, 2011
answer
7
For a random oracle R, does BPP equal the set of computable languages in P^R?
Oct 9, 2014

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.