Description of fast matrix multiplication algorithm: ⟨10×10×12:766⟩

Algorithm type

40 X^{4} Y^{4} Z^{4} + X^{4} Y^{2} Z^{4} + X^{2} Y^{6} Z^{2} + X^{2} Y^{2} Z^{6} + 11 X^{4} Y^{2} Z^{2} + X^{3} Y^{3} Z^{2} + 17 X^{2} Y^{4} Z^{2} + 16 X^{2} Y^{2} Z^{4} + X^{3} Y^{2} Z^{2} + 2 X^{2} Y^{2} Z^{3} + X Y^{5} Z + X Y Z^{5} + 2 X^{2} Y^{3} Z + 263 X^{2} Y^{2} Z^{2} + X^{2} Y Z^{3} + 3 X Y^{4} Z + 2 X Y Z^{4} + 3 X^{2} Y^{2} Z + 9 X^{2} Y Z^{2} + 7 X Y^{3} Z + 9 X Y Z^{3} + 71 X^{2} Y Z + 99 X Y^{2} Z + 93 X Y Z^{2} + 111 X Y Z

Algorithm definition

The algorithm ⟨10×10×12:766⟩ 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