Pages that link to "Item:Q4916029"
From MaRDI portal
The following pages link to Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication (Q4916029):
Displaying 11 items.
- Algebraic methods in the congested clique (Q2010605) (← links)
- HPMaX: heterogeneous parallel matrix multiplication using CPUs and GPUs (Q2212501) (← links)
- Improving the Numerical Stability of Fast Matrix Multiplication (Q2827068) (← links)
- Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074) (← links)
- Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
- Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra (Q4637194) (← links)
- Communication lower bounds and optimal algorithms for numerical linear algebra (Q4683913) (← links)
- From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891) (← links)
- Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic (Q5203969) (← links)
- (Q5857015) (← links)
- Pebbling Game and Alternative Basis for High Performance Matrix Multiplication (Q6087745) (← links)
