Dynamic Programming Algorithm (S. S. Godbole) (Matrix Chain Ordering Problem Matrix Chain Multiplication)

From Algorithm Wiki

Revision as of 10:32, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O(n^{2})$ words (CLRS) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1953 == Reference == -")

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

Jump to navigation Jump to search

Time Complexity

$O(n^{3})$

Space Complexity

$O(n^{2})$ words

(CLRS)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1953

Reference

-

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Dynamic_Programming_Algorithm_(S._S._Godbole)_(Matrix_Chain_Ordering_Problem_Matrix_Chain_Multiplication)&oldid=44387"