Description of fast matrix multiplication algorithm: ⟨7×9×12:508⟩

Algorithm type

18 X^{4} Y^{4} Z^{4} + 32 X^{4} Y^{3} Z^{3} + 12 X^{5} Y^{2} Z^{2} + 8 X^{3} Y^{4} Z^{2} + 60 X^{3} Y^{3} Z^{3} + 12 X^{4} Y^{2} Z^{2} + 28 X^{2} Y^{4} Z^{2} + 40 X^{2} Y^{3} Z^{3} + 20 X^{3} Y^{2} Z^{2} + 28 X Y^{3} Z^{3} + 32 X^{3} Y^{2} Z + 58 X^{2} Y^{2} Z^{2} + 32 X^{3} Y Z + 32 X^{2} Y^{2} Z + 32 X^{2} Y Z + 32 X Y^{2} Z + 32 X Y Z

Algorithm definition

The algorithm ⟨7×9×12:508⟩ 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