Matrix chain multiplication: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    10 October 2022

    • curprev 10:5810:58, 10 October 2022‎ Admin talk contribs‎ 2,060 bytes +2,060‎ Created page with "== Problem Description== Matrix chain multiplication (or Matrix Chain Ordering Problem, MCOP) is an optimization problem that to find the most efficient way to multiply a given sequence of matrices. The problem is not actually to perform the multiplications but merely to decide the sequence of the matrix multiplications involved. The matrix multiplication is associative as no matter how the product is parenthesized, the result obtained will remain the same. For example..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Matrix_chain_multiplication"