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.
Fast commutative matrix algorithms.arXiv preprint arXiv:1904.07683, 2019
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.