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

Algorithm type

34 X^{4} Y^{4} Z^{6} + 14 X^{4} Y^{4} Z^{5} + 50 X^{4} Y^{4} Z^{4} + 6 X^{9} Y Z + 3 X^{4} Y^{4} Z^{3} + 7 X Y^{9} Z + 3 X^{8} Y Z + 38 X^{6} Y^{2} Z^{2} + 13 X^{4} Y^{4} Z^{2} + 7 X^{3} Y^{4} Z^{3} + 38 X^{2} Y^{6} Z^{2} + 61 X^{2} Y^{4} Z^{4} + 60 X^{2} Y^{2} Z^{6} + 7 X^{6} Y^{2} Z + 9 X^{5} Y^{2} Z^{2} + 7 X^{2} Y^{6} Z + 43 X^{2} Y^{4} Z^{3} + 33 X^{2} Y^{2} Z^{5} + 5 X Y^{6} Z^{2} + 2 X^{6} Y Z + 2 X^{5} Y^{2} Z + 5 X^{4} Y^{2} Z^{2} + X^{3} Y^{4} Z + 62 X^{2} Y^{4} Z^{2} + 46 X^{2} Y^{2} Z^{4} + 25 X Y^{6} Z + X Y^{4} Z^{3} + X Y^{2} Z^{5} + 6 X Y Z^{6} + X^{5} Y Z + 13 X^{3} Y^{3} Z + 7 X^{3} Y^{2} Z^{2} + 8 X^{3} Y Z^{3} + X^{2} Y^{4} Z + 94 X^{2} Y^{2} Z^{3} + X Y^{4} Z^{2} + 6 X Y^{3} Z^{3} + 4 X Y^{2} Z^{4} + 3 X Y Z^{5} + 26 X^{3} Y^{2} Z + 11 X^{3} Y Z^{2} + 2 X^{2} Y^{3} Z + 36 X^{2} Y^{2} Z^{2} + X^{2} Y Z^{3} + X Y^{4} Z + 10 X Y^{3} Z^{2} + 4 X Y^{2} Z^{3} + 3 X Y Z^{4} + 9 X^{3} Y Z + 4 X^{2} Y^{2} Z + 4 X^{2} Y Z^{2} + 16 X Y^{3} Z + 183 X Y^{2} Z^{2} + 157 X Y Z^{3} + X^{2} Y Z + 38 X Y^{2} Z + 36 X Y Z^{2} + 9 X Y Z

Algorithm definition

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