Video details loaded
HomeMIT 6.046J Design and Analysis of Algorithms, Spring 2015Lecture 16: Complexity: P, NP, NP-completeness, Reductions
Lecture 16: Complexity: P, NP, NP-completeness, Reductions
1:25:25
Description: In this lecture, Professor Demaine introduces NP-completeness.
Instructors: Erik Demaine
