MIT
Lecture 23: Computational Complexity
Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresComputer ScienceEngineering
Om kurset
Description: This lecture introduces computational complexity, including how most decision problems are uncomputable, hardness and completeness, and reductions. Instructor: Erik Demaine