Computer Science
Profile Activity
Meta user
Network profile
734
reputation
4
12

tparker

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

2
answers
17
questions
~8k
people reached
  • Member for 4 years, 11 months
  • 32 profile views
  • Last seen Mar 29 at 12:23

Communities (24)

Top network posts

Top tags (20)

Score 4
Posts 17
Posts % 89
Score 4
Posts 5
Score 0
Posts 11
Score 0
Posts 6
Score 0
Posts 4
Score 0
Posts 2
View all tags →

Top posts (19)

All Questions Answers
Votes Newest
11 Why is NP in EXPTIME? Apr 22 '16
7 Known problems in BQP \ NP? May 9 '16
6 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 Are there any useful deterministic quantum algorithms for decision problems? May 12 '16
4 Complexity classes where $C^C = C$ Mar 26 '18
3 Is there a complexity class QPP? Mar 28 '20
3 Specific example of a problem that shows why **NP** isn't low for itself Jun 6 '18
3 Are there theoretical reasons for believing that P=NP is harder than other complexity problems? [duplicate] Apr 23 '16
View all questions and answers →

Badges (16)

Gold

—

Silver

4

Rarest

Bronze

12

Rarest

View all badges →

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.