Description of fast matrix multiplication algorithm: ⟨9×10×10:597⟩

Algorithm type

20 X^{4} Y^{4} Z^{4} + 3 X^{4} Y^{4} Z^{3} + 3 X^{3} Y^{4} Z^{4} + 6 X^{3} Y^{4} Z^{3} + X^{3} Y^{2} Z^{4} + X^{2} Y^{3} Z^{4} + 7 X^{4} Y^{2} Z^{2} + X^{3} Y^{2} Z^{3} + 6 X^{2} Y^{4} Z^{2} + 7 X^{2} Y^{2} Z^{4} + X Y^{3} Z^{4} + 8 X^{3} Y^{2} Z^{2} + 4 X^{2} Y^{3} Z^{2} + 6 X^{2} Y^{2} Z^{3} + 2 X^{4} Y Z + X^{2} Y^{3} Z + 182 X^{2} Y^{2} Z^{2} + 2 X Y^{4} Z + X Y^{3} Z^{2} + X Y^{2} Z^{3} + 2 X Y Z^{4} + 2 X^{3} Y Z + X^{2} Y^{2} Z + 9 X^{2} Y Z^{2} + 4 X Y^{3} Z + 7 X Y^{2} Z^{2} + 5 X Y Z^{3} + 62 X^{2} Y Z + 70 X Y^{2} Z + 60 X Y Z^{2} + 112 X Y Z

Algorithm definition

The algorithm ⟨9×10×10:597⟩ 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