P and NP classes, encoding problems and polynomial time verification, constructing NPC
very informal
Screencast Suthers 19 min
Show that circuit satisfiability is NP-Complete
Screencast Suthers 12 min
Examples of problems from logic, graph theory, and arithmetic
Screencast Suthers 25 min
Notes