Name: Lecture 23: Computational Complexity
Uploaded: 2013-01-14T20:26:48Z
Duration: 51 min 12 s
Description: Description: This lecture introduces computational complexity, including how most decision problems are uncomputable, hardness and completeness, and reductions. Instructor: Erik Demaine

51:12

Description: This lecture introduces computational complexity, including how most decision problems are uncomputable, hardness and completeness, and reductions.

Instructor: Erik Demaine