NP-complete - Complexity Theory - Design and Analysis of Algorithms

In this video I define a polynomial time reduction and use it to define the class of NP-complete problems. We also take a look at a simple reduction between clique and independent set.