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

Algorithm type

12 X^{4} Y^{8} Z^{4} + 2 X^{2} Y^{9} Z^{2} + 18 X^{4} Y^{4} Z^{4} + 2 X Y^{10} Z + 12 X^{2} Y^{7} Z^{2} + 4 X^{2} Y^{7} Z + 18 X^{2} Y^{6} Z^{2} + 24 X^{2} Y^{4} Z^{4} + 4 X Y^{8} Z + 7 X^{2} Y^{5} Z^{2} + 10 X Y^{7} Z + 6 X^{2} Y^{5} Z + 36 X^{2} Y^{4} Z^{2} + 36 X^{2} Y^{2} Z^{4} + 13 X^{2} Y^{4} Z + 12 X Y^{5} Z + 2 X Y^{3} Z^{3} + 6 X^{2} Y^{3} Z + 81 X^{2} Y^{2} Z^{2} + 33 X Y^{4} Z + 25 X Y^{3} Z^{2} + 6 X^{3} Y Z + 3 X^{2} Y^{2} Z + 40 X Y^{3} Z + 4 X^{2} Y Z + 3 X Y^{2} Z + 85 X Y Z^{2} + 90 X Y Z

Algorithm definition

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