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

Transcript

Course Info

Learning Resource Types

theaters Lecture Videos
theaters Recitation Videos
assignment_turned_in Problem Sets with Solutions
grading Exams with Solutions
assignment_turned_in Programming Assignments with Examples
notes Lecture Notes