6.006 | Fall 2011 | Undergraduate

Introduction to Algorithms

Lecture Videos

Lecture 23: Computational Complexity

Description: This lecture introduces computational complexity, including how most decision problems are uncomputable, hardness and completeness, and reductions.

Instructor: Erik Demaine

Course Info

Learning Resource Types
Lecture Videos
Recitation Videos
Problem Sets with Solutions
Exams with Solutions
Programming Assignments with Examples
Lecture Notes