NPTEL Video Course : Theory of Automata, Formal Languages and Computation

Lecture 36 - NP - Complete Problems, Cook's Theorem