What are the differences between NP, NP-Complete and NP-Hard?
What are the differences between NP , NP-Complete and NP-Hard ? I am aware of many resources all over the web. I'd like to read your explanations, and the reason is they might be different from what's out there, or there is something that I'm not aware of. jason I assume that you are looking for intuitive definitions, since the technical definitions require quite some time to understand. First of all, let's remember a preliminary needed concept to understand those definitions. Decision problem : A problem with a yes or no answer. Now, let us define those complexity classes . P P is a