Prakesh Ramanan (Approximate MCOP Matrix Chain Multiplication)
Jump to navigation
Jump to search
Time Complexity
$O(log^{4} n)$
Space Complexity
$O(n)$? words
(Derived: $n$ subtrees and each one has a $O(1)$ size trunk)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
CREW PRAM
Year
1996