Pages that link to "Item:Q3330500"
From MaRDI portal
The following pages link to Computation of Matrix Chain Products. Part II (Q3330500):
Displaying 8 items.
- Dynamic programming bi-criteria combinatorial optimization (Q777429) (← links)
- Dynamic programming with convexity, concavity and sparsity (Q1190452) (← links)
- Dynamic programming and graph optimization problems (Q1327180) (← links)
- Greedy algorithms for optimal computing of matrix chain products involving square dense and triangular matrices (Q3016172) (← links)
- Speed-Up in Dynamic Programming (Q3958292) (← links)
- Lower bounds for the matrix chain ordering problem (Q5096328) (← links)
- Material coherence from trajectories via Burau eigenanalysis of braids (Q5112979) (← links)
- Revisiting “Computation of Matrix Chain Products'' (Q5233109) (← links)