Theoretical Computer Science

Nice Answer

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

earned this badge 15 times.
Stochastic version of a strongly NP-Complete problem
Awarded Sep 10, 2021 at 14:36
The cozy neighborhoods of "P" and of "NP-hard"
Awarded Jun 7, 2016 at 5:10
Above #P and counting search problems
Awarded Mar 13, 2015 at 3:50
Smallest Boolean circuit to generate a language
Awarded Apr 21, 2014 at 0:46
Examples where the uniqueness of the solution makes it easier to find
Awarded Apr 13, 2014 at 22:11
Hardness of noisy Boolean functions
Awarded Sep 12, 2013 at 1:50
Why does randomness have stronger effect on reductions than on algorithms?
Awarded Dec 26, 2012 at 6:02
The cozy neighborhoods of "P" and of "NP-hard"
Awarded Dec 25, 2012 at 15:27
Natural problems in $NP \cap coNP$ not in $UP \cap coUP$?
Awarded Jul 9, 2012 at 23:16
Is optimally solving the n×n×n Rubik's Cube NP-hard?
Awarded Jun 29, 2011 at 17:19
Are there known to exist functions with the following direct-sum property?
Awarded Apr 23, 2011 at 16:29
If P = BQP, does this imply that PSPACE (= IP) = AM?
Awarded Nov 3, 2010 at 9:02
What kind of mathematical background is needed for complexity theory?
Awarded Nov 1, 2010 at 6:01
DFA intersection in subquadratic space?
Awarded Sep 12, 2010 at 21:46
Lower bounds on Gaussian complexity
Awarded Aug 25, 2010 at 18:13

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.