Theoretical Computer Science

Nice Question

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

earned this badge 3 times.
Exact exponential-time algorithms for 0-1 programming
Awarded Apr 24 '14 at 3:53
Reasons to believe $P \ne NP \cap coNP$ (or not)
Awarded Nov 28 '13 at 12:30
How can a problem be in NP, be NP-hard and not NP-complete?
Awarded Apr 1 '13 at 11:41

Others with this badge