Lecture 21: Dynamic Programming III: Parenthesization, Edit Distance, Knapsack

Name: Lecture 21: Dynamic Programming III: Parenthesization, Edit Distance, Knapsack
Uploaded: 2013-01-14T20:26:39Z
Duration: 52 min 41 s
Description: Description: 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. Instructor: Erik Demaine

52:41

Description: 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.

Instructor: Erik Demaine