Dynamic Programming Algorithm (S. S. Godbole) (Matrix Chain Ordering Problem Matrix Chain Multiplication): Difference between revisions
Jump to navigation
Jump to search
(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 == -") |
No edit summary |
||
| Line 7: | Line 7: | ||
$O(n^{2})$ words | $O(n^{2})$ words | ||
(CLRS) | (CLRS http://mitpress.mit.edu/9780262046305/introduction-to-algorithms/) | ||
== Description == | == Description == | ||
Latest revision as of 08:30, 10 April 2023
Time Complexity
$O(n^{3})$
Space Complexity
$O(n^{2})$ words
(CLRS http://mitpress.mit.edu/9780262046305/introduction-to-algorithms/)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1953
Reference
-