A rank-23 scheme for 3x3 matrix multiplication over arbitrary associative rings that uses 56 additions/subtractions and 23 multiplications with all coefficients in {-1,0,1}, verified by satisfying the 729 Brent equations over the integers.
A rank 23 algorithm for mul- tiplying 3×3 matrices with an arithmetic complexity of 59
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An Exact 56-Addition, Rank-23 Scheme for General 3*3 Matrix Multiplication
A rank-23 scheme for 3x3 matrix multiplication over arbitrary associative rings that uses 56 additions/subtractions and 23 multiplications with all coefficients in {-1,0,1}, verified by satisfying the 729 Brent equations over the integers.