Theoretical Computer Science
Ryan O'Donnell's user avatar
Ryan O'Donnell's user avatar
Ryan O'Donnell's user avatar
Ryan O'Donnell
  • Member for 13 years, 3 months
  • Last seen more than a month ago
Profile Activity
Stats
1,801
reputation
15k
reached
10
answers
1
question
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
17
silver badges
21
bronze badges
Top tags
View all tags
105
Score
6
Posts
55
Posts %
37
Score
2
Posts
18
Posts %
33
Score
3
Posts
27
Posts %
26
Score
1
Posts
9
Posts %
24
Score
1
Posts
9
Posts %
19
Score
1
Posts
9
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
28
Is uniform RNC contained in polylog space?
Jul 24, 2013
answer
26
What's the "smallest" complexity class for which a superlinear circuit bound is known?
Dec 5, 2010
answer
24
Is there an NP-complete language that contains precisely half of the n-bit instances?
Nov 26, 2016
answer
19
Theoretical explanations for practical success of SAT solvers?
Apr 1, 2017
answer
18
Super-polynomial time approximation algorithms for MAX 3SAT
Dec 9, 2011
answer
13
Are there any known NP problems which are conjectured to be exponentially hard on average?
Dec 5, 2012
answer
10
When is the duality gap of semidefinite programming (SDP) zero?
Aug 18, 2016
answer
10
Random 3-SAT: What is the consensus experimental range of the threshold?
Nov 15, 2016
answer
9
Linearly independent Fourier coefficients
Jul 12, 2012
answer
5
Potentially equal complexity classes without known contradictory relativizations
Nov 12, 2015
Top network posts
View all network posts
164
Example of a good Zero Knowledge Proof
46
What is the time complexity of computing sin(x) to t bits of precision?
43
Proposals for polymath projects
32
Pseudonyms of famous mathematicians
23
Equivalent forms of the P vs. NP problem

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.