Computation of Matrix Chain Products. Part I

DOI10.1137/0211028zbMath0483.68041OpenAlexW4238323774WikidataQ56028819 ScholiaQ56028819MaRDI QIDQ3942395

No author found.

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)

Related Items

Dynamic programming and graph optimization problems ⋮ Lower bounds for the matrix chain ordering problem ⋮ Material coherence from trajectories via Burau eigenanalysis of braids ⋮ Dynamic programming with convexity, concavity and sparsity ⋮ 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 ⋮ Revisiting “Computation of Matrix Chain Products ⋮ Dynamic programming bi-criteria combinatorial optimization ⋮ Triangulations (tilings) and certain block triangular matrices