A Little More Complexity Theory
Concepts
Review of P and NP
Polynomial-Time Reducibility
Asymmetry
NP-hard
NP-complete
SAT
Classic Results
The Cook-Levin Theorem: SAT is NP-complete
Some Illustrative Problems
Homework
1. Is Longest Path in
(a) NP?
(b) co-NP?
2. Show that Independent Set is NP-complete.
(Hint: use Clique.)