Czumaj (Approximate MCOP Matrix Chain Multiplication)

From Algorithm Wiki
Revision as of 11:34, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(\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 == CREW PRAM == Year == 1996 == Reference == https://citeseerx.ist.psu.edu/viewdoc/download?d...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(\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

CREW PRAM

Year

1996

Reference

https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.218.8168&rep=rep1&type=pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Czumaj_(Approximate_MCOP_Matrix_Chain_Multiplication)&oldid=44486"