MIT
Lecture 21: 3SUM and APSP Hardness
Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresComputer ScienceScience & MathMathematicsEngineering
Om kurset
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.