The paper claims a 44x44 base-case matrix multiplication algorithm with exponent 2.773203, beating Pan's 2.773372, but the proof of the key lemma is flawed.
Adaptive flip graph algorithm for matrix multiplication
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation
The paper claims a 44x44 base-case matrix multiplication algorithm with exponent 2.773203, beating Pan's 2.773372, but the proof of the key lemma is flawed.