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
Instructors
Departments
As Taught In
Fall
2011
Level
Learning Resource Types
grading
Exam Solutions
grading
Exams
notes
Lecture Notes
theaters
Lecture Videos
assignment_turned_in
Problem Set Solutions
assignment
Problem Sets
theaters
Problem-solving Videos
assignment_turned_in
Programming Assignments with Examples