Video details loaded
HomeMIT 6.890 Algorithmic Lower Bounds, Fall 2014Lecture 1: Overview
Lecture 1: Overview
1:17:31
Up Next
Lecture 2: 3-Partition I
Description: In this lecture, Professor Demaine gives a brief overview of the class, summarizing the prerequisite complexity theory and featuring two examples of hardness proofs in games.
Instructor: Erik Demaine
A video player with synced slides and lecture notes is available.