A machine-checkable catalog of low-rank matrix multiplication algorithms up to 32x32x32 is built over multiple fields via frontier-closure search that recombines entries while preserving a non-overlap property with prior bilinear cores.
A non-commutative algorithm for multiplying4 × 4matrices using 48 non-complex multiplications, 2025
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.SC 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Exploits special structural features in tensor decompositions to lower the matrix multiplication exponent for 6x6 matrices from 2.8075 to 2.8019.
citing papers explorer
-
A catalog of fast matrix multiplication algorithms with frontier-closure search
A machine-checkable catalog of low-rank matrix multiplication algorithms up to 32x32x32 is built over multiple fields via frontier-closure search that recombines entries while preserving a non-overlap property with prior bilinear cores.
-
Exploiting the Structure in Tensor Decompositions for Matrix Multiplication
Exploits special structural features in tensor decompositions to lower the matrix multiplication exponent for 6x6 matrices from 2.8075 to 2.8019.