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

Algorithm type

32 X^{6} Y^{6} Z^{4} + 32 X^{5} Y^{6} Z^{4} + 48 X^{6} Y^{6} Z^{2} + 48 X^{5} Y^{6} Z^{2} + 20 X^{4} Y^{4} Z^{4} + 64 X^{3} Y^{3} Z^{6} + 12 X^{2} Y^{2} Z^{8} + 6 X^{4} Y^{4} Z^{3} + 6 X^{4} Y^{3} Z^{4} + 4 X^{4} Y^{3} Z^{3} + 96 X^{3} Y^{3} Z^{3} + 6 X^{2} Y^{2} Z^{5} + 28 X^{4} Y^{2} Z^{2} + 96 X^{3} Y^{3} Z^{2} + 22 X^{2} Y^{4} Z^{2} + 8 X Y^{3} Z^{4} + 4 X^{4} Y^{2} Z + 4 X^{4} Y Z^{2} + 144 X^{3} Y^{3} Z + 2 X^{2} Y^{4} Z + 10 X^{2} Y^{3} Z^{2} + 8 X Y^{2} Z^{4} + 2 X^{2} Y^{3} Z + 96 X^{2} Y^{2} Z^{2} + 36 X Y Z^{4} + 72 X^{2} Y Z + 120 X Y^{2} Z + 56 X Y Z

Algorithm definition

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