T. C. Hu ; M. T. Shing (Matrix Chain Ordering Problem Matrix Chain Multiplication)
Revision as of 10: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")
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