Theoretical Computer Science

Help Center > Badges > Nice Answer

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

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

Others with this badge