Theoretical Computer Science
Ryan O'Donnell
  • Member for 11 years
Profile Activity
Stats
1,781
reputation
13k
reached
10
answers
1
questions
About
Apparently, this user prefers to keep an air of mystery about them.

Communities (17)

Top network posts

This user doesn’t have any gold badges yet.
16
silver badges
20
bronze badges
View all badges

Top tags (24)

Score 103
Posts 6
Posts % 55
Score 37
Posts 2
Score 32
Posts 3
Score 25
Posts 1
Score 24
Posts 1
Score 18
Posts 1
View all tags →

Top posts (11)

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
View all questions and answers →

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.