- Recap from Friday
- Class NP
- Non-deterministic Turing machines
- Cook-Levin theorem
- Coping with NP Hardness
Cite this work
Researchers should cite this work as follows:
EE 226, Purdue University, West Lafayette, IN
Use the error messages below to try and resolve the issue. If you are still unable to fix the problem report your problem to the system administrator by entering a support ticket.
- Unable to find presentation.