Lecture Videos
Lecture 19: Complexity
This lecture discusses computational complexity and introduces terminology: P, NP, EXP, R. These terms are applied to the concepts of hardness and completeness. The lecture ends with discussion on reductions.
Instructor: Erik Demaine
Course Info
Instructors
Departments
As Taught In
Spring
2020
Level
Topics
Learning Resource Types
theaters
Lecture Videos
grading
Exams with Solutions
notes
Lecture Notes
assignment
Problem Sets
Problem Set Solutions
