6.046J | Spring 2015 | Undergraduate

Design and Analysis of Algorithms

Lecture Videos

Lecture 16: Complexity: P, NP, NP-completeness, Reductions

Description: In this lecture, Professor Demaine introduces NP-completeness.

Instructors: Erik Demaine

Notes for Lecture 16 (PDF) are available.
Learning Resource Types
Lecture Videos
Recitation Videos
Problem Sets with Solutions
Exams with Solutions
Lecture Notes
Instructor Insights