Theoretical Computer Science
matt hastings
  • Member for 11 years
  • Last seen more than 10 years ago
Profile Activity
Stats
959
reputation
10k
reached
3
answers
5
questions
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
5
silver badges
14
bronze badges
Top tags
View all tags
18
Score
2
Posts
25
Posts %
10
Score
1
Posts
12
Posts %
8
Score
7
Posts
88
Posts %
8
Score
1
Posts
12
Posts %
8
Score
1
Posts
12
Posts %
8
Score
1
Posts
12
Posts %
Top posts
All Questions Answers Articles
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
9
Separation of classes with different amounts of advice?
Nov 19 '10
8
Quantum PCP and hardness of simulating of Hamiltonians
Nov 18 '10
6
Distributions over circuits and N-to-N vs N-to-1 circuits
Dec 16 '10
Top network posts
View all network posts
7
Mathematical "urban legends"

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.