T. C. Hu ; M. T. Shing (Matrix Chain Ordering Problem Matrix Chain Multiplication): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O(n)$ words (can be derived?) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1982 == Reference == https://citeseerx.ist.psu.edu/viewdoc/citations?doi=10.1.1.695.2923")
 
No edit summary
 
Line 1: Line 1:
== Time Complexity ==  
== Time Complexity ==  


$O(nlogn)$
$O(n \log n)$


== Space Complexity ==  
== Space Complexity ==  
Line 31: Line 31:
== Reference ==  
== Reference ==  


https://citeseerx.ist.psu.edu/viewdoc/citations?doi=10.1.1.695.2923
https://doi.org/10.1137/0211028

Latest revision as of 09:33, 10 April 2023

Time Complexity

$O(n \log n)$

Space Complexity

$O(n)$ words

(can be derived?)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1982

Reference

https://doi.org/10.1137/0211028