Description of fast matrix multiplication algorithm: ⟨9×11×12:738⟩

Algorithm type

12 X^{6} Y^{6} Z^{6} + 40 X^{5} Y^{6} Z^{6} + 12 X^{4} Y^{6} Z^{6} + 68 X^{3} Y^{6} Z^{6} + 28 X^{2} Y^{6} Z^{6} + 16 X^{6} Y^{3} Z^{3} + 44 X^{5} Y^{3} Z^{3} + 5 X^{6} Y^{2} Z^{2} + 16 X^{4} Y^{3} Z^{3} + 31 X^{5} Y^{2} Z^{2} + 88 X^{3} Y^{3} Z^{3} + 51 X^{4} Y^{2} Z^{2} + 28 X^{2} Y^{3} Z^{3} + 31 X^{3} Y^{2} Z^{2} + 8 X Y^{3} Z^{3} + 54 X^{3} Y^{2} Z + 54 X^{3} Y Z^{2} + 8 X^{2} Y^{2} Z^{2} + 44 X^{2} Y^{2} Z + 44 X^{2} Y Z^{2} + 28 X Y^{2} Z + 28 X Y Z^{2}

Algorithm definition

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