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

Name: Lecture 18: Dynamic Programming, Part 4: Rods, Subset Sum, Pseudopolynomial
Uploaded: 2021-09-13T16:19:44Z
Duration: 1 h 3 min 45 s
Description: 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

1:03:45

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