Chandra (Approximate MCOP Matrix Chain Multiplication)

From Algorithm Wiki

Revision as of 10:34, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n)$? words (Derived: cannot find pdf of original paper or any description of the actual algorithm, but likely the same space as Chin's algorithm) == Description == == Approximate? == Approximate Approximation Factor: 2 == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1975 == Reference == https://www.worldcat.org/title/computing-matrix-chain-products-in-near-...")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

$O(n)$? words

(Derived: cannot find pdf of original paper or any description of the actual algorithm, but likely the same space as Chin's algorithm)

Description

Approximate?

Approximate

Approximation Factor: 2

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1975

Reference

https://www.worldcat.org/title/computing-matrix-chain-products-in-near-optimal-time/oclc/727708286

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Chandra_(Approximate_MCOP_Matrix_Chain_Multiplication)&oldid=44488"