Lecture

Matrix Chain Multiplication

Description

This lecture covers the dynamic programming algorithm for matrix chain multiplication, explaining the bottom-up approach to find the optimal solution. It discusses the algorithm for recovering an optimal solution and provides examples of matrix dimensions and instances. The instructor also explains the choice of where to make the outermost parenthesis and the overlapping subproblems. Additionally, the lecture introduces the concept of the longest common subsequence, defining it as a non-consecutive subsequence common to two sequences.

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
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.