Dynamic Program for Matrix Chain Multiplication
m[i,j] = minimum number of scalar multiplications needed to compute A i..j
Solution = m[1,n]
How to compute m[i,j]:
mini<= k < j{ m[i,k] + m[k+1,j] + pi-1pkpj} i < j (*)
Previous slide
Next slide
Back to first slide
View graphic version