MIT

Lecture 19: Unbounded Games

Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresComputer ScienceScience & MathMathematicsEngineering

Om kurset

Description: In this lecture, Professor Demaine gives examples of real bounded games proved PSPACE-complete via constraint logic. Instructor: Erik Demaine A video player with synced slides and lecture notes is available.