Introduction to Algorithms: Dynamic Programming III: Parenthesization, Edit Distance, Knapsack

Dynamic Programming III: Parenthesization, Edit Distance, Knapsack

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.