We’re rewarding the question askers & reputations are being recalculated! Read more.
Theoretical Computer Science
Meta user
Network profile
949
reputation
5
13

matt hastings

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

3
answers
5
questions
~8k
people reached
  • Member for 9 years
  • 175 profile views
  • Last seen Feb 9 '11 at 19:22

Communities (2)

Top network posts

Top tags (18)

Score 18
Posts 2
Posts % 25
Score 10
Posts 1
Score 8
Posts 7
Score 8
Posts 1
Score 8
Posts 1
Score 8
Posts 1
View all tags →

Top posts (8) All Questions Answers | Votes Newest

25 What's the “smallest” complexity class for which a superlinear circuit bound is known? Dec 5 '10
17 NEXP-complete problems Nov 24 '10
15 Are there known to exist functions with the following direct-sum property? Nov 17 '10
12 Explicit polynomials in 1 variable with superlogarithmic circuit complexity lower bounds? Nov 29 '10
10 The complexity of Area-lawed Hamiltonians Nov 17 '10
8 Quantum PCP and hardness of simulating of Hamiltonians Nov 18 '10
8 Separation of classes with different amounts of advice? Nov 19 '10
6 Distributions over circuits and N-to-N vs N-to-1 circuits Dec 16 '10

Badges (18)

Gold

—

Silver

5

Rarest

Bronze

13

Rarest

View all badges →