Computer Science
Meta user
Network profile
644
reputation
4
12

tparker

I am a graduate student in Physics at UC Santa Barbara.

2
answers
15
questions
~5k
people reached
  • Member for 3 years, 7 months
  • 29 profile views
  • Last seen Nov 21 at 4:32

Communities (21)

Top network posts

Top tags (16)

Score 4
Posts 15
Posts % 88
Score 4
Posts 5
Score 0
Posts 10
Score 0
Posts 5
Score 0
Posts 4
Score 0
Posts 2
View all tags →

Top posts (17) All Questions Answers | Votes Newest

11 Why is NP in EXPTIME? Apr 22 '16
6 Known problems in BQP \ NP? May 9 '16
5 Have any natural complexity classes been proven not to be closed under complement? Jun 13 '18
4 Are there deterministic and/or non-interactive zero-knowledge proofs? Sep 15 '18
4 Should we always think of problems higher in the polynomial hierarchy as harder than problems lower in the hierarchy? Mar 15 '18
4 Complexity classes where $C^C = C$ Mar 26 '18
3 Specific example of a problem that shows why **NP** isn't low for itself Jun 6 '18
3 Are there any useful deterministic quantum algorithms for decision problems? May 12 '16
3 Are there theoretical reasons for believing that P=NP is harder than other complexity problems? [duplicate] Apr 23 '16
2 Is the existence of an oracle such that $P^O = NP^O$ nontrivial? [duplicate] Jun 6 '18
View all questions and answers →

Badges (16)

Gold

—

Silver

4

Rarest

Bronze

12

Rarest

View all badges →