4.3 Matrix Chain Multiplication - Dynamic Programming

2,600,421 views

About this video

Hand-picked by a BrighterTube curator · found via ErikCH/DevYouTubeList · 88% confidence

Solves matrix-chain multiplication with a dynamic-programming table to find the cheapest parenthesisation, tracing every cell; one of the longer, more thorough lectures in Abdul Bari's course.

Matrix chain multiplication: choosing the optimal parenthesisation with dynamic programming.

Video by Abdul Bari, played through YouTube's embedded player.

Part of Algorithms