Czumaj (Approximate MCOP Matrix Chain Multiplication): Difference between revisions

Latest revision as of 10:19, 28 April 2023

$O(\log \log n)$

$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)

Approximate

Approximation Factor: 1.1547

No, deterministic

COMMON CRCW PRAM

1996

Revision as of 09:32, 10 April 2023 (view source) Admin (talk \| contribs) No edit summary Tags: Manual revert Reverted ← Older edit	Latest revision as of 10:19, 28 April 2023 (view source) Admin (talk \| contribs) No edit summary Tag: Manual revert
(One intermediate revision by the same user not shown)
(No difference)