Pages that link to "Item:Q4388882"
From MaRDI portal
The following pages link to Efficient Matrix Chain Ordering in Polylog Time (Q4388882):
Displaying 4 items.
- On efficient parallel computations for some dynamic programming problems (Q1109691) (← links)
- Greedy algorithms for optimal computing of matrix chain products involving square dense and triangular matrices (Q3016172) (← links)
- Computation of Matrix Chain Products. Part II (Q3330500) (← links)
- Revisiting “Computation of Matrix Chain Products'' (Q5233109) (← links)