Matrix chain multiplication Consider the problem of minimizing the total number of multiplications made in computing the product of n matrices A1 . A2 . . . . . An whose dimensions are d0 d1, d1 d2, . . . , dn?1 dn, respectively. Assume that all intermediate products of two matrices are computed by the bruteforce (definition-based) algorithm.