Next:
NP-Completeness
P
Problems
Decision Problems
Encoding Problems
Formal Languages
Example: PATH decision problem language
Decision Problems and Algorithms
Decision Problems and Algorithms
Polynomial-Time Verification
Hamiltonian Cycles
Verification Algorithms
NP
Reducibility
Examples
Lemma 36.3
NP-Completeness
Theorem 36-4
Next: