Description of fast matrix multiplication algorithm: ⟨11×13×15:1371⟩

Algorithm type

12 X^{4} Y^{6} Z^{4} + 8 X^{4} Y^{5} Z^{4} + 46 X^{4} Y^{4} Z^{4} + 4 X^{3} Y^{6} Z^{3} + 6 X^{3} Y^{5} Z^{4} + 3 X^{2} Y^{8} Z^{2} + 13 X^{2} Y^{2} Z^{8} + X^{4} Y^{4} Z^{3} + 7 X^{4} Y^{3} Z^{4} + 2 X^{3} Y^{5} Z^{3} + 4 X^{3} Y^{4} Z^{4} + 6 X^{2} Y^{7} Z^{2} + 6 X^{2} Y^{3} Z^{6} + 19 X^{4} Y^{2} Z^{4} + 18 X^{3} Y^{4} Z^{3} + 13 X^{3} Y^{3} Z^{4} + 35 X^{2} Y^{6} Z^{2} + 6 X^{2} Y^{3} Z^{5} + 40 X^{2} Y^{2} Z^{6} + X Y^{8} Z + 3 X^{4} Y^{2} Z^{3} + 4 X^{3} Y^{3} Z^{3} + X^{3} Y^{2} Z^{4} + 23 X^{2} Y^{5} Z^{2} + 26 X^{2} Y^{2} Z^{5} + 3 X^{2} Y Z^{6} + 2 X Y^{6} Z^{2} + 48 X^{3} Y^{3} Z^{2} + 8 X^{3} Y^{2} Z^{3} + 4 X^{3} Y Z^{4} + 54 X^{2} Y^{4} Z^{2} + 9 X^{2} Y Z^{5} + 3 X Y^{6} Z + 5 X Y^{5} Z^{2} + 3 X Y^{4} Z^{3} + 4 X Y^{3} Z^{4} + 72 X^{3} Y^{3} Z + 2 X^{3} Y Z^{3} + 32 X^{2} Y^{3} Z^{2} + 10 X Y^{4} Z^{2} + 21 X Y^{3} Z^{3} + 18 X Y^{2} Z^{4} + 6 X^{3} Y^{2} Z + 4 X^{3} Y Z^{2} + 195 X^{2} Y^{2} Z^{2} + 34 X^{2} Y Z^{3} + 18 X Y^{4} Z + 8 X Y^{3} Z^{2} + 58 X Y^{2} Z^{3} + 30 X Y Z^{4} + 6 X^{3} Y Z + 3 X^{2} Y^{2} Z + 20 X^{2} Y Z^{2} + 68 X Y^{3} Z + 3 X Y^{2} Z^{2} + 13 X Y Z^{3} + 54 X^{2} Y Z + 108 X Y^{2} Z + 13 X Y Z^{2} + 125 X Y Z

Algorithm definition

The algorithm ⟨11×13×15:1371⟩ is taken from:

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

Algorithm description

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