1.

Why did we use diagonal in solving matrix multiplication dynamic programming

Answer»

Explanation:

Matrix chain multiplication (or Matrix Chain Ordering Problem, MCOP) is an optimization problem that can be SOLVED USING dynamic programming. Given a sequence of matrices, the GOAL is to FIND the most EFFICIENT way to multiply these matrices. ... There are many options because matrix multiplication is associative.



Discussion

No Comment Found