1,813,816

MIT 6.890 Algorithmic Lower Bounds, Fall 2014

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
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...
Play all

Loading...

to add this to Watch Later

Add to

Loading playlists...