Computation of Matrix Chain Products. Part I

DOI10.1137/0211028MaRDI QIDQ3942395zbMATH OpenOpenAlexDBLPWikidataFDO

Authors

Publication date 1982

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

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

zbMATH Keywords

dynamic programmingmatrix multiplicationpolygon partition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(12)

• Dynamic programming with convexity, concavity and sparsity
• Dynamic programming and graph optimization problems
• Greedy algorithms for optimal computing of matrix chain products involving square dense and triangular matrices
• Sequential optimization of matrix chain multiplication relative to different cost functions
• Triangulations (tilings) and certain block triangular matrices
• Lower bounds for the matrix chain ordering problem (extended abstract)
• Material coherence from trajectories via Burau eigenanalysis of braids
• Revisiting ``Computation of matrix chain products
• Tensor ranks and the fine-grained complexity of dynamic programming
• On the parenthesisations of matrix chains: all are useful, few are essential
• On the I/O complexity of the Cocke-Younger-Kasami algorithm and of a family of related dynamic programming algorithms
• Dynamic programming bi-criteria combinatorial optimization

This page was built for publication: Computation of Matrix Chain Products. Part I

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3942395)