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.

Course Info

Departments

As Taught In

Spring 2015

Level

Undergraduate

Topics

Learning Resource Types

Exam Solutions
Exams
Instructor Insights
Lecture Notes
Lecture Videos
Problem Set Solutions
Problem Sets
Problem-solving Videos
Download Course
MIT Open Learning
Over 2,500 courses & materials
Freely sharing knowledge with learners and educators around the world. Learn more
© 2001–2026 Massachusetts Institute of Technology
Accessibility
Creative Commons License
Terms and Conditions
Proud member of:
© 2001–2026 Massachusetts Institute of Technology