Pages that link to "Item:Q4895834"
From MaRDI portal
The following pages link to An Efficient Parallel Algorithm for the Matrix-Chain-Product Problem (Q4895834):
Displaying 10 items.
- On efficient parallel computations for some dynamic programming problems (Q1109691) (← links)
- A faster parallel algorithm for a matrix searching problem (Q1206437) (← 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)
- A Parallel and Vector Variant of the Cyclic Reduction Algorithm (Q3796625) (← links)
- On Efficient Parallel Algorithms for Solving Set Recurrence Equations (Q4033767) (← links)
- Efficient Matrix Chain Ordering in Polylog Time (Q4388882) (← links)
- A faster parallel algorithm for a matrix searching problem (Q5056103) (← links)
- An optimal parallel algorithm for computing a near-optimal order of matrix multiplications (Q5056129) (← links)
- Revisiting “Computation of Matrix Chain Products'' (Q5233109) (← links)