= Lecture 21: Dynamic Programming III
{c}
{tag=Work by Massachusetts Institute of Technology, 6.006 course staff}
{title2=Fall 2011 course}
Unsigned lecture notes in <6.006 Introduction to Algorithms, Fall 2011 by Massachusetts Institute of Technology, 6.006 course staff>, issued by the Massachusetts Institute of Technology and hosted by MIT OpenCourseWare. No individual author byline is established. Fall 2011 identifies the course offering; no separate publication or revision date is established.
Lecture notes: https://ocw.mit.edu/courses/6-006-introduction-to-algorithms-fall-2011/3484e876d81aba07911a1109f5b5e81e_MIT6_006F11_lec21.pdf
Cited passages: Printed p. 1: lecture header and dynamic programming review; Printed p. 2: Parenthesization, outermost split, substring state, recurrence, one-matrix zero base case, increasing substring size, cubic time and parent pointers; PDF p. 6: MIT OpenCourseWare course and Fall 2011 footer.
Back to article page
