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 hardness of problems that can be solved in polynomial time, but where that polynomial seems to be substantially superlinear. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu/