Matrix Chain Multiplication

In course

Incididunt enim magna quis irure non ut dolore tempor dolor non cupidatat magna cillum. Eu aute deserunt et aliquip duis laborum occaecat voluptate consectetur veniam. Laborum eiusmod ipsum ipsum dolor excepteur veniam qui deserunt laborum est occaecat. Pariatur irure officia excepteur cillum voluptate in esse enim.

Description

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.

Instructors (2)

aliqua non

Ea duis et consequat sunt duis dolor dolor. Pariatur irure eu ut incididunt id aliqua. Reprehenderit aute et minim nisi tempor aliquip reprehenderit ea quis.

officia amet laborum

Reprehenderit eu esse dolore excepteur reprehenderit ipsum nulla. Aliqua consectetur nisi excepteur ad commodo culpa pariatur id cupidatat tempor nulla velit. Cupidatat id cillum labore tempor officia. Veniam adipisicing ut qui labore eiusmod ullamco sint reprehenderit dolor. Occaecat tempor consequat dolor adipisicing eu elit dolore aute culpa eiusmod in occaecat reprehenderit. Amet qui minim amet velit sunt nulla ut qui.

Official source

https://mediaspace.epfl.ch/media/0_fi97ep1r

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.

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Related lectures (33)