We’re rewarding the question askers & reputations are being recalculated! Read more.
Theoretical Computer Science
Meta user
Network profile
1,721
reputation
16
20

Ryan O'Donnell

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

10
answers
1
question
~11k
people reached
  • Member for 9 years, 2 months
  • 276 profile views
  • Last seen 9 hours ago

Communities (17)

Top network posts

Top tags (23)

Score 98
Posts 6
Posts % 55
Score 35
Posts 2
Score 28
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 Super-polynomial time approximation algorithms for MAX 3SAT Dec 9 '11
15 Theoretical explanations for practical success of SAT solvers? Apr 1 '17
11 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
9 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 →

Badges (36)

Gold

—

Silver

16

Rarest

Bronze

20

Rarest

View all badges →