A normal form for matrix multiplication schemes

DOI10.1007/978-3-031-19685-0_11arXiv2206.00550OpenAlexW4312763629MaRDI QIDQ6108729

Jakob Moosbauer, Manuel Kauers

Publication date: 26 July 2023

Published in: Algebraic Informatics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2206.00550

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Flip Graphs for Matrix Multiplication

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
• Equivalent polyadic decompositions of matrix multiplication tensors
• Fast commutative matrix algorithms
• New ways to multiply \(3 \times 3\)-matrices
• On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication
• Gaussian elimination is not optimal
• On multiplication of 2 \(\times\) 2 matrices
• The bilinear complexity and practical algorithms for matrix multiplication
• Noncommutative Bilinear Algorithms for $3 \times 3$ Matrix Multiplication
• A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications

This page was built for publication: A normal form for matrix multiplication schemes