Definitions, etc.
NP : class of problems whose solutions can be verified in polynomial time.
A problem Q is NP-hard if every problem in NP is polynomially reducible to Q.
A problem Q is NP-complete if
Q belongs to NP
Q is NP-hard
Previous slide
Next slide
Back to first slide
View graphic version