Theoretical Computer Science

Nice Answer

 Nice Answer
Answer score of 10 or more. This badge can be awarded multiple times.

earned this badge 37 times.
Quantum oracle for non-negative vector
Awarded Mar 30 '19 at 10:25
Consequences of $NP\subseteq P/poly$ to $BQP$
Awarded Jan 1 '18 at 0:44
What is the complexity of distinguishing a true Fourier spectra from a fake one?
Awarded Jan 1 '18 at 0:44
Proof of undecidability not by reduction from the halting problem
Awarded Nov 7 '15 at 11:11
What is the Relationship between QMA and AM?
Awarded Sep 21 '15 at 3:44
Oracular separations between poly- and log-depth quantum circuits
Awarded Jul 9 '14 at 4:17
The unreasonable power of non-uniformity
Awarded Apr 30 '14 at 19:00
Computational complexity of pi
Awarded Mar 31 '14 at 9:47
Why are so few natural candidates for NP-intermediate status?
Awarded Feb 9 '14 at 2:26
Techniques for showing that problem is in hardness "limbo"
Awarded Feb 6 '14 at 1:54
Alan Turing's Contributions to Computer Science
Awarded Jan 27 '14 at 11:11
Techniques for proving that a sentence relativizes
Awarded Oct 3 '13 at 6:03
A simple decision problem whose decidability is not known
Awarded Sep 5 '13 at 9:14
New algorithm for Discrete log and its implications for Quantum computing
Awarded Jun 26 '13 at 8:27
Ed. Witten's new paper and the simulation of a quantum field theory
Awarded May 1 '13 at 5:37
Do natural generalizations of P versus NP exist?
Awarded Apr 8 '13 at 16:40
Relativized world where ${\bf P^A}={\bf NP^A}\not = {\bf PP^A}$
Awarded Mar 31 '13 at 21:55
Is adiabatic quantum computing as powerful as the circuit model?
Awarded Mar 23 '13 at 12:44
How did TCS become conference-oriented rather than journal-oriented?
Awarded Jan 26 '13 at 3:45
Consequences of $BQP \subseteq P/poly$?
Awarded Jan 18 '13 at 5:52
The cozy neighborhoods of "P" and of "NP-hard"
Awarded Dec 25 '12 at 14:57
Complexity of optimization over unitary group
Awarded Oct 20 '12 at 23:50
Applicability of Church-Turing thesis to interactive models of computation
Awarded Aug 26 '12 at 10:43
Should experts in TCS charge money to read proofs that P != NP?
Awarded Aug 5 '11 at 14:19
Extended Church-Turing Thesis
Awarded Jul 29 '11 at 14:13
$BQP$ vs $QMA$?
Awarded Nov 25 '10 at 0:32
Is $PH \subseteq PP$?
Awarded Nov 24 '10 at 15:31
Can relativization results be used to prove sentences formally independent?
Awarded Nov 20 '10 at 20:22
How does the BosonSampling paper avoid easy classes of complex matrices?
Awarded Nov 14 '10 at 0:21
Approximate counting problem capturing BQP
Awarded Nov 6 '10 at 23:19
Quantum computing project ideas
Awarded Oct 28 '10 at 10:11
Interactive proofs for levels of the polynomial hierarchy
Awarded Oct 28 '10 at 2:55
Is the Chomsky-hierarchy outdated?
Awarded Oct 19 '10 at 13:57
Can we decide whether a permanent has a unique term?
Awarded Oct 19 '10 at 1:28
Rigour leading to insight
Awarded Oct 13 '10 at 7:35
Are there canonical non-relativizing techniques?
Awarded Oct 9 '10 at 2:06
A decision problem which is not known to be in PH but will be in P if P=NP
Awarded Oct 9 '10 at 0:56

Others with this badge

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.