Score: 1
A 60-Addition, Rank-23 Scheme for Exact 3x3 Matrix Multiplication
Published: August 5, 2025 |
arXiv ID: 2508.03857v2
By: Joshua Stapleton
Potential Business Impact:
Makes computers multiply big numbers faster.
We reduce the additive cost of general (non-commutative) 3x3 matrix multiplication from the previous records of 61 (Schwartz-Vaknin, 2023) and 62 (Martensson-Wagner, 2025) to 60 without a change of basis. To our knowledge, this represents a new state-of-the-art.
Similar Papers
100%
A 60-Addition, Rank-23 Scheme for Exact 3x3 Matrix Multiplication
Data Structures and Algorithms
Makes computers multiply big numbers faster.
5 Aug 2025
1
87%
(Approximate) Matrix Multiplication via Convolutions
Data Structures and Algorithms
Makes computers multiply big numbers much faster.
25 Oct 2025
0
86%
A non-commutative algorithm for multiplying 4x4 matrices using 48 non-complex multiplications
Symbolic Computation
Computers multiply big numbers faster using fewer steps.
16 Jun 2025
0
Country of Origin
🇬🇧
United Kingdom
Page Count
12 pages
Category
Computer Science:
Data Structures and Algorithms