Prakesh Ramanan (Approximate MCOP Matrix Chain Multiplication): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 10:4210:42, 15 February 2023‎ Admin talk contribs‎ 354 bytes +354‎ 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.ezproxy.canberra.edu.au/doi/abs/10.1137/0225039"
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Prakesh_Ramanan_(Approximate_MCOP_Matrix_Chain_Multiplication)"