2 papers
cs.SC2025
A Rank 23 Algorithm for Multiplying 3 x 3 Matrices with an Arithmetic Complexity of 59
Erik Mårtensson, Paul Stankovski Wagner, Joshua Stapleton
In 1969 Strassen showed surprisingly that it is possible to multiply two 2 x 2 matrices using seven multiplications and 18 additions, instead of the naive eight multiplications and…
cs.DS2025
A 60-Addition, Rank-23 Scheme for Exact 3x3 Matrix Multiplication
Joshua Stapleton
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 wi…