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
Lecture Videos
Recitation Videos
Problem Sets with Solutions
Exams with Solutions
Lecture Notes
Instructor Insights
Download Course
MIT Open Learning
Over 2,500 courses & materials
Freely sharing knowledge with learners and educators around the world. Learn more
© 2001–2024 Massachusetts Institute of Technology
Accessibility
Creative Commons License
Terms and Conditions
Proud member of:
© 2001–2024 Massachusetts Institute of Technology