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 explains L-reductions to prove various problems APX-complete, introduces a characterization theorem for approximability, and mentions the approximation spectrum.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu/
1 Comments