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
Transcript
Lecture Notes
| Instructors: | |
| Course Number: |
|
| Departments: | |
| As Taught In: | Fall 2011 |
| Level: |
Undergraduate
|
Learning Resource Types
theaters
Lecture Videos
theaters
Recitation Videos
assignment_turned_in
Problem Sets with Solutions
grading
Exams with Solutions
assignment_turned_in
Programming Assignments with Examples
notes
Lecture Notes