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
Course Info
Instructors
Departments
As Taught In
Spring
2020
Level
Learning Resource Types
grading
Exam Solutions
grading
Exams
notes
Lecture Notes
theaters
Lecture Videos
assignment_turned_in
Problem Set Solutions
assignment
Problem Sets
