Prakesh Ramanan (Approximate MCOP Matrix Chain Multiplication)
Revision as of 11:42, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(log^{4} n)$ == Space Complexity == $O(n)$? words (Derived: $n$ subtrees and each one has a $O(1)$ size trunk) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == CREW PRAM == Year == 1996 == Reference == https://epubs.siam.org/doi/abs/10.1137/0225039")
Time Complexity
$O(log^{4} n)$
Space Complexity
$O(n)$? words
(Derived: $n$ subtrees and each one has a $O(1)$ size trunk)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
CREW PRAM
Year
1996