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

Algorithm type

16 X^{5} Y^{2} Z^{6} + 16 X^{5} Y Z^{6} + 96 X^{4} Y^{4} Z^{4} + 8 X^{5} Y Z^{5} + 29 X^{4} Y^{2} Z^{2} + 222 X^{2} Y^{4} Z^{2} + 27 X^{2} Y^{2} Z^{4} + X^{4} Y Z^{2} + 10 X^{3} Y^{2} Z^{2} + 2 X^{4} Y Z + 275 X^{2} Y^{2} Z^{2} + 2 X^{2} Y Z^{3} + 60 X Y^{4} Z + 4 X Y^{3} Z^{2} + 11 X^{3} Y Z + 54 X^{2} Y^{2} Z + 18 X^{2} Y Z^{2} + X Y^{3} Z + 54 X Y^{2} Z^{2} + 8 X Y Z^{3} + 85 X^{2} Y Z + 180 X Y^{2} Z + 85 X Y Z^{2} + 121 X Y Z

Algorithm definition

The algorithm ⟨10×15×15:1385⟩ 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