P and NP classes, encoding problems and polynomial time verification, constructing NPC
Understand np-completeness.
Examples of problems from logic, graph theory, and arithmetic
Screencast Suthers 25 min
P and NP classes, encoding problems and polynomial time verification, constructing NPC
Notes