Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the concept of dynamic programming, focusing on the Matrix Chain Multiplication problem. The instructor explains the main idea behind dynamic programming, the optimal substructure, and the choice of where to make cuts and parentheses. Examples are provided to illustrate the calculations involved in matrix chain multiplication, along with the algorithm for recovering an optimal solution. Additionally, the lecture discusses the longest common subsequence problem.