Theory of Computation
https://uvatoc.github.io/week11

25.3 Cook-Levin Theorem
- Defining NP-Hard and NP-Complete
- The Cook-Levin Theorem
- NANDSAT
- Proving NANDSAT is NP-Hard
- Implications of P=NP

David Evans and Nathan Brunelle
University of Virginia