Revisiting “Computation of Matrix Chain Products

DOI10.1137/18M1195401zbMath1437.65039OpenAlexW2971727418MaRDI QIDQ5233109

Elad Weiss, Oded Schwartz

Publication date: 16 September 2019

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/18m1195401

zbMATH Keywords

algorithmsmatrix multiplicationmatrix chain product

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical linear algebra (65F99)

Cites Work

• Dynamic programming with convexity, concavity and sparsity
• Dynamic programming via static incrementalization
• Fast sparse matrix multiplication
• Computation of Matrix Chain Products. Part II
• Computation of Matrix Chain Products. Part I
• Speed-Up in Dynamic Programming
• A New Lower Bound Technique and Its Application: Tight Lower Bound for a Polygon Triangulation Problem
• Efficient Matrix Chain Ordering in Polylog Time
• An Efficient Parallel Algorithm for the Matrix-Chain-Product Problem
• Unnamed Item

This page was built for publication: Revisiting “Computation of Matrix Chain Products