Czumaj (Approximate MCOP Matrix Chain Multiplication)
Jump to navigation
Jump to search
Time Complexity
$O(\log \log n)$
Space Complexity
$O(n)$ words?
(Derived: solving the optimal triangulation problem of a convex polygon where there are $n+1$ vertices and $n+1$, so total $O(n)$ auxiliary space)
Description
Approximate?
Approximate
Approximation Factor: 1.1547
Randomized?
No, deterministic
Model of Computation
COMMON CRCW PRAM
Year
1996
Reference
https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.218.8168&rep=rep1&type=pdf