Description of fast matrix multiplication algorithm: ⟨32×32×32:15096⟩

Algorithm type

10880 X^{3} Y^{3} Z^{3} + 544 X^{3} Y^{2} Z^{2} + 544 X^{2} Y^{3} Z^{2} + 544 X^{2} Y^{2} Z^{3} + 850 X^{2} Y^{2} Z^{2} + 34 X Y^{2} Z^{2} + 17 X^{2} Y Z + 34 X Y^{2} Z + 1649 X Y Z

Algorithm definition

The algorithm ⟨32×32×32:15096⟩ is taken from:

Oded Schwartz and Eyal Zwecher. Towards faster feasible matrix multiplication by trilinear aggregation. Technical report, arXiv, August 2025. [ arXiv ]

Algorithm description

maple tensor representation (compressed by bzip2);
maple LRP representation (compressed by bzip2);
maple evaluation scheme (compressed by bzip2).

These encodings are given in compressed text format using the maple computer algebra system. In each cases, the last line could be understood as a description of the encoding with respect to classical matrix multiplication algorithm. As these outputs are structured, one can construct easily a parser to its favorite format using the maple documentation without this software.

Back to main table