Czumaj (Matrix Chain Scheduling Problem Matrix Chain Multiplication)
Jump to navigation
Jump to search
Time Complexity
$O(log^{3} n)$
Space Complexity
$O(n^{2})$? words
(Derived: uses two arrays ($D$ and $c$) both of size $O(n^2)$)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
CREW PRAM
Year
1993
Reference
https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.54.9426&rep=rep1&type=pdf