Pages that link to "Item:Q5056129"
From MaRDI portal
The following pages link to An optimal parallel algorithm for computing a near-optimal order of matrix multiplications (Q5056129):
Displaying 8 items.
- An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh (Q685469) (← links)
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field (Q1097640) (← links)
- (Q3128924) (← links)
- Computation of Matrix Chain Products. Part II (Q3330500) (← links)
- (Q4327513) (← links)
- Efficient Matrix Chain Ordering in Polylog Time (Q4388882) (← links)
- An Efficient Parallel Algorithm for the Matrix-Chain-Product Problem (Q4895834) (← links)
- Lower bounds for the matrix chain ordering problem (Q5096328) (← links)