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

Algorithm type

16 X^{6} Y^{7} Z^{6} + 72 X^{6} Y^{6} Z^{6} + 108 X^{6} Y^{4} Z^{6} + 8 X^{6} Y^{3} Z^{6} + 36 X^{6} Y^{2} Z^{6} + 28 X^{3} Y^{7} Z^{3} + 12 X^{3} Y^{6} Z^{3} + 30 X^{2} Y^{8} Z^{2} + 76 X^{3} Y^{5} Z^{3} + 5 X^{2} Y^{7} Z^{2} + 152 X^{3} Y^{4} Z^{3} + 13 X^{2} Y^{6} Z^{2} + 20 X^{3} Y^{3} Z^{3} + 52 X^{2} Y^{5} Z^{2} + 36 X^{3} Y^{2} Z^{3} + 55 X^{2} Y^{4} Z^{2} + 76 X^{3} Y Z^{3} + 82 X^{2} Y^{4} Z + 82 X Y^{4} Z^{2} + 8 X^{2} Y^{3} Z + 25 X^{2} Y^{2} Z^{2} + 18 X Y^{4} Z + 8 X Y^{3} Z^{2} + 8 X^{2} Y^{2} Z + 8 X Y^{2} Z^{2} + 46 X^{2} Y Z + 46 X Y Z^{2} + 18 X Y Z

Algorithm definition

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