Computation of Matrix Chain Products. Part II
From MaRDI portal
Recommendations
Cited in
(17)- 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
- Speed-Up in Dynamic Programming
- scientific article; zbMATH DE number 4126588 (Why is no real title available?)
- scientific article; zbMATH DE number 1042590 (Why is no real title available?)
- scientific article; zbMATH DE number 1501237 (Why is no real title available?)
- 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
- Algorithm 993: Efficient computation with Kronecker products
- An approximation algorithm for the matrix tree multiplication problem
- On sparse 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
- Dynamic programming bi-criteria combinatorial optimization
This page was built for publication: Computation of Matrix Chain Products. Part II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3330500)
