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, Constantinos Daskalakis
In the second of two guest lectures by Prof. Constantinos Daskalakis of CSAIL, Daskalakis talks about examples of PPAD-completeness reductions, as well as other classes related to PPAD.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu/
3 Comments