Lecture 21: DP III: Parenthesization, Edit Distance, Knapsack

Published: Dec. 7, 2012, 7:53 p.m.

This lecture starts with how to define useful subproblems for strings or sequences, and then looks at parenthesization, edit distance, and the knapsack problem. The lecture ends with a brief discussion of pseudopolynomial time.