Lecture Videos
Lecture 21: Dynamic Programming III: Parenthesization, Edit Distance, Knapsack
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
Course Info
Instructors
Departments
As Taught In
Fall
2011
Level
Learning Resource Types
grading
Exam Solutions
grading
Exams
notes
Lecture Notes
theaters
Lecture Videos
assignment_turned_in
Problem Set Solutions
assignment
Problem Sets
theaters
Problem-solving Videos
assignment_turned_in
Programming Assignments with Examples
