Stack Exchange
sign up
|
log in
|
chat
|
meta
|
about
|
faq
Computer Science
beta
Questions
Tags
Tour
Users
Ask Question
Badge
Student
Asked first question with score of 1 or more.
rubixibuc earned this badge
nov 28 at 2:48
All NP problems reduce to NP-complete problems: so how can NP problems not be NP-complete?
Others with this badge
Computer Science Stack Exchange works best with JavaScript enabled