Video details loaded
HomeMIT 6.890 Algorithmic Lower Bounds, Fall 2014Lecture 2: 3-Partition I
MIT 6.890 Algorithmic Lower Bounds, Fall 2014
Video 2 of 10
Lecture 2: 3-Partition I
1:23:35
Up Next
Lecture 3: 3-Partition II
Description: In this lecture, Professor Demaine introduces the concept of 3-partition and its many variations, a starting point for NP-hardness reductions. Weak and strong NP-hardness proofs are seen in the context of other examples.
Instructor: Erik Demaine
A video player with synced slides and lecture notes is available.