An O(n) algorithm for determining a near-optimal computation order of matrix chain products
From MaRDI portal
Publication:4156871
DOI10.1145/359545.359556zbMath0377.15005OpenAlexW2041094700MaRDI QIDQ4156871
Publication date: 1978
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/359545.359556
Matrix equations and identities (15A24) Software, source code, etc. for problems pertaining to linear algebra (15-04) Algorithms in computer science (68W99)
Related Items (4)
Dynamic programming and graph optimization problems ⋮ An optimal parallel algorithm for computing a near-optimal order of matrix multiplications ⋮ Lower bounds for the matrix chain ordering problem ⋮ Greedy algorithms for optimal computing of matrix chain products involving square dense and triangular matrices
This page was built for publication: An O(n) algorithm for determining a near-optimal computation order of matrix chain products
