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

Algorithm type

36 X^{4} Y^{4} Z^{4} + 36 X^{3} Y^{4} Z^{4} + 46 X^{5} Y^{2} Z^{2} + 30 X^{3} Y^{4} Z^{2} + 6 X^{3} Y^{2} Z^{4} + 72 X^{4} Y^{2} Z^{2} + 36 X^{2} Y^{4} Z^{2} + 48 X^{2} Y^{2} Z^{4} + 5 X^{5} Y Z + 63 X^{3} Y^{2} Z^{2} + 6 X Y^{4} Z^{2} + 18 X Y^{2} Z^{4} + 2 X^{4} Y Z + 88 X^{3} Y^{2} Z + 38 X^{3} Y Z^{2} + 45 X^{2} Y^{2} Z^{2} + 22 X^{3} Y Z + 77 X^{2} Y^{2} Z + 98 X^{2} Y Z^{2} + 19 X^{2} Y Z + 36 X Y^{2} Z + 64 X Y Z^{2} + 11 X Y Z

Algorithm definition

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