T. C. Hu ; M. T. Shing (Matrix Chain Ordering Problem Matrix Chain Multiplication)

From Algorithm Wiki

Revision as of 09:33, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n \log n)$

Space Complexity

$O(n)$ words

(can be derived?)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1982

Reference

https://doi.org/10.1137/0211028

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=T._C._Hu_;_M._T._Shing_(Matrix_Chain_Ordering_Problem_Matrix_Chain_Multiplication)&oldid=47314"