9. Graph Problems

MIT 6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs, Fall 2014
View the complete course: http://ocw.mit.edu/6-890F14
Instructor: Erik Demaine

In this lecture, Professor Demaine finishes up NP-hardness, and the various techniques involved in such proofs.

License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu

Post time: 12-26-2016