Name: Lecture 19: Complexity
Uploaded: 2021-09-13T16:19:45Z
Duration: 59 min 9 s
Description: 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

59:09

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