Theoretical Computer Science

Nice Answer

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

earned this badge 6 times.
Evidence that Graph Isomorphism problem is not $NP$-complete
Awarded Feb 4 '19 at 5:10
Consequences of $NP=coNP$ and $P\ne NP$?
Awarded Jan 30 '16 at 11:57
Easy to optimize but hard to evaluate
Awarded Nov 10 '15 at 7:15
Which randomized algorithms have exponentially small error probability?
Awarded Jun 11 '15 at 14:13
Problems that are easy on unweighted graphs, but hard for weighted graphs
Awarded Jun 2 '14 at 7:04
Is NP in $DTIME(n^{poly\log n})$?
Awarded Mar 24 '14 at 22:51

Others with this badge