Video details loaded
HomeMIT 6.890 Algorithmic Lower Bounds, Fall 2014Lecture 18: 0- and 2-Player Games

Lecture 18: 0- and 2-Player Games

1:20:38

Description: In this lecture, Professor Demaine proves hardness for game with fewer or more than one player.

Instructor: Erik Demaine

A video player with synced slides and lecture notes is available.