Lecture 23: Computational Complexity

Published: Dec. 7, 2012, 7:59 p.m.

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