Flip Graphs for Matrix Multiplication
From MaRDI portal
Publication:6081958
DOI10.1145/3597066.3597120arXiv2212.01175OpenAlexW4383213621MaRDI QIDQ6081958
Jakob Moosbauer, Manuel Kauers
Publication date: 3 November 2023
Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.01175
Cites Work
- Unnamed Item
- On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication
- On the complexity of the multiplication of matrices of small formats
- Local search for fast matrix multiplication
- New ways to multiply \(3 \times 3\)-matrices
- Gaussian elimination is not optimal
- On multiplication of 2 \(\times\) 2 matrices
- Modern Computer Algebra
- The bilinear complexity and practical algorithms for matrix multiplication
- New Fast Algorithms for Matrix Operations
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
- Discovering faster matrix multiplication algorithms with reinforcement learning
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- A normal form for matrix multiplication schemes
This page was built for publication: Flip Graphs for Matrix Multiplication
