MIT 6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs, Fall 2014
MIT OpenCourseWare
EducationScience
Clips are not offered for this film yet: it is in several files, and clips are cut from a film in one.
Parts
About
View the complete course: http://ocw.mit.edu/6-890F14
Instructor: Erik Demaine
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.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
- Archive
- Internet Archive, in MIT OpenCourseWare
- Licence or status
- CC BY-NC-SA 3.0, as the Internet Archive states it.
- Credit
- MIT OpenCourseWare
- Language
- English
- Subtitles
- English
- Who can watch
- The archive gives no rating. Invisible Network shows it to Tweens profiles and older, judged from its collection and subjects. How films are placed