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

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.