6.006 | Spring 2020 | Undergraduate

Introduction to Algorithms

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

Learning Resource Types
Lecture Videos
Problem Sets with Solutions
Exams with Solutions
Lecture Notes