Proving a Problem is NP-complete
Cook proved that there exist NP-complete problems (satisfiability).
Once we have one, can start blazing.
To prove a problem Q is NP-complete
- show Q is in NP
- show R is polynomially reducible to Q, for some NP-complete problem R.