An automated search framework proves that 3x3 matrix multiplication over F2 requires at least 20 bilinear operations, improving the prior lower bound of 19.
The bilinear complexity and practical algorithms for matrix multiplication
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 framework proves that 3x3 matrix multiplication over F2 requires at least 20 bilinear operations, improving the prior lower bound of 19.