ECE 595E Lecture 4: NP-hardness
Category
Published on
Abstract
Outline:
- Recap from Friday
- Class NP
- Non-deterministic Turing machines
- Reducibility
- Cook-Levin theorem
- Coping with NP Hardness
Cite this work
Researchers should cite this work as follows:
Time
Location
EE 226, Purdue University, West Lafayette, IN