Brute Force (Matrix Chain Ordering Problem Matrix Chain Multiplication)
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
-