Heejo Lee; Jong Kim; Sungje Hong; and Sunggu Lee (Approximate MCSP Matrix Chain Multiplication)
Jump to navigation
Jump to search
Time Complexity
$O(n^{2})$
Space Complexity
$O(n^{2})$? words
(Derived: two $n \times n$ size tables ($S$ and $W$))
Description
Approximate?
Approximate
Approximation Factor: "near optimal"
Randomized?
No, deterministic
Model of Computation
Word RAM?
Year
1997
Reference
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.56.222&rep=rep1&type=pdf