View by Category

Lecture 2: Dynamic Programming - PowerPoint PPT Presentation

The presentation will start after a short
(15 second) video ad from one of our sponsors.

Hot tip: Video ads won’t appear to registered users who are logged in. And it’s free to register and free to log in!
About This Presentation

Lecture 2: Dynamic Programming


Greedy idea #1 gives (AB)(CD), which takes 500 1000 500 = 2000 ops ... Exercises. The matrixChain algorithm only computes #operations of an optimal parenthesization. ... – PowerPoint PPT presentation

Number of Views:1909
Avg rating:3.0/5.0
Slides: 105
Provided by: taiwe
Learn more at:


Write a Comment
User Comments (0)
Transcript and Presenter's Notes