15-453 Formal Languages, Automata, and Computation
Lecture 31: The Class NP
We show that the class NP can be defined in two equivalent ways:
via non-deterministic Turing machines or via a polynomial-time
verifier. We then examine further problems which lie in the
class NP, such as CLIQUE and SUBSET-SUM.