Czumaj (Approximate MCOP Matrix Chain Multiplication): Difference between revisions
Jump to navigation
Jump to search
(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...") |
No edit summary Tag: Manual revert |
||
| (6 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(\log n)$ | $O(\log \log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
| Line 25: | Line 25: | ||
== Model of Computation == | == Model of Computation == | ||
COMMON CRCW PRAM | |||
== Year == | == Year == | ||
Latest revision as of 10:19, 28 April 2023
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