Description of fast matrix multiplication algorithm: ⟨6×9×11:404⟩

Algorithm type

X^{4} Y^{5} Z^{4} + 11 X^{4} Y^{4} Z^{4} + X^{4} Y^{3} Z^{4} + 48 X^{2} Y^{6} Z^{3} + 2 X^{4} Y^{3} Z^{3} + 11 X^{2} Y^{6} Z^{2} + 16 X^{2} Y^{5} Z^{3} + 44 X Y^{6} Z^{3} + X^{2} Y^{5} Z^{2} + X^{2} Y^{3} Z^{4} + 2 X Y^{6} Z^{2} + 50 X Y^{5} Z^{3} + 12 X^{4} Y^{2} Z^{2} + 8 X^{2} Y^{4} Z^{2} + X^{2} Y^{3} Z^{3} + 6 X^{2} Y^{2} Z^{4} + 2 X Y^{6} Z + 2 X Y^{4} Z^{3} + 2 X^{3} Y^{3} Z + 4 X^{2} Y^{3} Z^{2} + X^{2} Y Z^{4} + 19 X^{2} Y^{3} Z + 49 X^{2} Y^{2} Z^{2} + 2 X Y^{3} Z^{2} + 4 X^{3} Y Z + 41 X Y^{3} Z + 4 X Y Z^{3} + 9 X^{2} Y Z + 3 X Y^{2} Z + 4 X Y Z^{2} + 43 X Y Z

Algorithm definition

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