Video details loaded
HomeMIT 6.890 Algorithmic Lower Bounds, Fall 2014Lecture 21: 3SUM and APSP Hardness
Lecture 21: 3SUM and APSP Hardness
1:19:23
Description: 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.
Instructor: Erik Demaine
A video player with synced slides and lecture notes is available here.