Can someone please summarize the exact difference between NP-Complete and NP-Hard problems in simple language? Wiki and my standard books aren't exactly helping.
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top
closed as too localized by Aaron Roth, Kaveh, Tsuyoshi Ito, Noam, Daniel Apon Oct 9 '10 at 17:38
This question is unlikely to help any future visitors; it is only relevant to a small geographic area, a specific moment in time, or an extraordinarily narrow situation that is not generally applicable to the worldwide audience of the internet. For help making this question more broadly applicable, visit the help center.If this question can be reworded to fit the rules in the help center, please edit the question.