Matrix Chain Ordering Problem

Matrix chain multiplication (or Matrix Chain Ordering Problem; MCOP) is an optimization problem. Given a sequence of matrices, the goal is to find the most efficient way to multiply these matrices.

Parameters

$n$ : number of matrices

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Displaying 3 of 3 algorithms


T. C. Hu ; M. T. Shing	1982	$O(n \log n)$	$O(n)$
Dynamic Programming Algorithm (S. S. Godbole)	1953	$O(n^3)$	$O(n^2)$
Brute Force	1940	$O(4^n)$	$O(n)$

Reductions Table

Insuffient Data to display table

Other relevant algorithms