Brute Force (Matrix Chain Ordering Problem Matrix Chain Multiplication)

From Algorithm Wiki

Revision as of 11:31, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == O ({4}^n) == Space Complexity == $O(n)$ words (can be derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference == -")

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

Jump to navigation Jump to search

Time Complexity

O ({4}^n)

Space Complexity

$O(n)$ words

(can be derived)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1940

Reference

-

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Brute_Force_(Matrix_Chain_Ordering_Problem_Matrix_Chain_Multiplication)&oldid=44386"