Description of fast matrix multiplication algorithm: ⟨9×12×14:940⟩

Algorithm type

24 X^{6} Y^{6} Z^{5} + 8 X^{6} Y^{6} Z^{4} + 36 X^{6} Y^{6} Z^{3} + 12 X^{6} Y^{6} Z^{2} + 23 X^{4} Y^{4} Z^{5} + 13 X^{4} Y^{4} Z^{4} + 48 X^{2} Y^{3} Z^{7} + 80 X^{2} Y^{3} Z^{6} + 68 X Y^{3} Z^{7} + 34 X^{2} Y^{2} Z^{6} + 88 X Y^{3} Z^{6} + 18 X^{4} Y^{2} Z^{3} + 18 X^{2} Y^{4} Z^{3} + 18 X^{2} Y^{2} Z^{5} + 20 X Y^{3} Z^{5} + 18 X^{4} Y^{2} Z^{2} + 18 X^{2} Y^{4} Z^{2} + 56 X^{2} Y^{2} Z^{4} + 16 X Y^{3} Z^{4} + 25 X^{2} Y^{2} Z^{3} + 11 X^{2} Y^{2} Z^{2} + 78 X^{2} Y Z^{3} + 78 X Y^{2} Z^{3} + 38 X^{2} Y Z^{2} + 38 X Y^{2} Z^{2} + 28 X^{2} Y Z + 28 X Y^{2} Z

Algorithm definition

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