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

Algorithm type

64 X^{6} Y^{6} Z^{6} + 16 X^{5} Y^{6} Z^{7} + 64 X^{6} Y^{6} Z^{4} + 16 X^{5} Y^{6} Z^{5} + 28 X^{5} Y^{6} Z^{4} + 32 X^{6} Y^{6} Z^{2} + 12 X^{5} Y^{6} Z^{3} + 8 X^{5} Y^{6} Z^{2} + 32 X^{3} Y^{3} Z^{7} + 16 X^{3} Y^{3} Z^{6} + 5 X^{2} Y^{2} Z^{8} + 88 X^{3} Y^{3} Z^{5} + 7 X^{2} Y^{2} Z^{7} + 148 X^{3} Y^{3} Z^{4} + 32 X^{3} Y^{3} Z^{3} + 11 X^{2} Y^{2} Z^{5} + 80 X^{3} Y^{3} Z^{2} + 16 X^{2} Y^{2} Z^{4} + 164 X^{3} Y^{3} Z + 18 X^{2} Y Z^{4} + 22 X Y^{2} Z^{4} + 9 X^{2} Y^{2} Z^{2} + 6 X^{2} Y Z^{3} + 10 X Y^{2} Z^{3} + 4 X Y Z^{4} + 4 X Y Z^{3} + 12 X^{2} Y Z + 28 X Y^{2} Z + 16 X Y Z

Algorithm definition

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