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.
Dynamic Programming: Rod Cutting and Matrix Chain Multiplication
This lecture covers the concept of dynamic programming, focusing on rod cutting and matrix chain multiplication. It explains the main idea behind dynamic programming, key elements in designing DP algorithms, and reconstructing optimal solutions. The instructor discusses the cost of matrix multiplication and provides a detailed explanation of matrix chain multiplication, aiming to minimize the number of scalar multiplications in a chain of matrices.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace