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

From Algorithm Wiki

Revision as of 11:35, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O(n)$ words (can be derived?) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1982 == Reference == https://citeseerx.ist.psu.edu/viewdoc/citations?doi=10.1.1.695.2923")

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

Jump to navigation Jump to search

Time Complexity

$O(nlogn)$

Space Complexity

$O(n)$ words

(can be derived?)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1982

Reference

https://citeseerx.ist.psu.edu/viewdoc/citations?doi=10.1.1.695.2923

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=44534"