Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
DOI10.1137/19M124695XzbMATH Open1528.68419OpenAlexW3217451041WikidataQ114074260 ScholiaQ114074260MaRDI QIDQ6139832FDOQ6139832
Virginia Vassilevska Williams, Josh Alman
Publication date: 19 December 2023
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/19m124695x
Multilinear algebra, tensor calculus (15A69) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Powers of tensors and fast matrix multiplication
- Gaussian elimination is not optimal
- Improved bound for complexity of matrix multiplication
- Relative bilinear complexity and matrix multiplication.
- Partial and Total Matrix Multiplication
- Multiplying matrices faster than coppersmith-winograd
- Matrix multiplication via arithmetic progressions
- On the Asymptotic Complexity of Matrix Multiplication
- Geometry and Complexity Theory
- On sunflowers and matrix multiplication
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- Bounds for matchings in nonabelian groups
- On cap sets and the group-theoretic approach to matrix multiplication
- The growth rate of tri-colored sum-free sets
- Further Limitations of the Known Approaches for Matrix Multiplication
- Fast Matrix Multiplication
This page was built for publication: Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6139832)
