MIT

Lecture 18: Dynamic Programming, Part 4: Rods, Subset Sum, Pseudopolynomial

Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresComputer ScienceScience & MathMathematicsEngineering

Om kurset

This is the fourth and final lecture on dynamic programming. This class focusses on integer subproblems and pseudopolynomial time. Two worked examples are given: rod cutting and subset sum. Instructor: Erik Demaine