An automated search proves that multiplying two 3x3 matrices over GF(2) requires at least 20 bilinear multiplications, raising the prior lower bound of 19.
A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications.Bulletin of the American Mathematical Society, 82(1):126–128, January 1976
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Automated Lower Bounds for Small Matrix Multiplication Complexity over Finite Fields
An automated search proves that multiplying two 3x3 matrices over GF(2) requires at least 20 bilinear multiplications, raising the prior lower bound of 19.