Pages that link to "Item:Q5395700"
From MaRDI portal
The following pages link to Graph expansion and communication costs of fast matrix multiplication (Q5395700):
Displaying 11 items.
- Communication efficient matrix multiplication on hypercubes (Q582005) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- Algorithms and conditional lower bounds for planning problems (Q2238604) (← links)
- Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization (Q2816298) (← links)
- Improving the numerical stability of fast matrix multiplication (Q2827068) (← 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)
- Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles (Q5091160) (← links)
- Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions (Q5157832) (← links)
- Pebbling Game and Alternative Basis for High Performance Matrix Multiplication (Q6087745) (← links)
- Algorithm Design for Tensor Units (Q6487193) (← links)