Description of fast matrix multiplication algorithm: ⟨3×10×15:335⟩

Algorithm type

X^{3} Y^{3} Z^{2} + X^{3} Y^{2} Z^{3} + X Y^{6} Z + 10 X^{2} Y^{3} Z^{2} + 5 X^{2} Y^{2} Z^{3} + X Y^{4} Z^{2} + X^{3} Y^{2} Z + 99 X^{2} Y^{2} Z^{2} + 7 X Y^{4} Z + 3 X Y^{3} Z^{2} + X Y^{2} Z^{3} + 5 X^{3} Y Z + 18 X Y^{3} Z + 28 X Y^{2} Z^{2} + 22 X Y Z^{3} + 6 X^{2} Y Z + 55 X Y^{2} Z + 50 X Y Z^{2} + 21 X Y Z

Algorithm definition

The algorithm ⟨3×10×15:335⟩ is taken from:

Andrew I. Perminov. FastMatrixMultiplication, GitHub, February 2026. [ GitHub repository ]

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