Description of fast matrix multiplication algorithm: ⟨6×12×14:645⟩

Algorithm type

12 X^{4} Y^{6} Z^{4} + 21 X^{4} Y^{4} Z^{4} + 6 X^{2} Y^{8} Z^{2} + 64 X^{2} Y^{7} Z^{3} + 88 X Y^{7} Z^{3} + 18 X^{2} Y^{6} Z^{2} + 32 X^{2} Y^{5} Z^{3} + 8 X Y^{6} Z^{3} + 24 X^{4} Y^{3} Z^{2} + 28 X Y^{5} Z^{3} + 42 X^{4} Y^{2} Z^{2} + 18 X^{2} Y^{4} Z^{2} + 16 X Y^{4} Z^{3} + 12 X^{2} Y^{4} Z + 24 X^{2} Y^{3} Z^{2} + 4 X Y^{3} Z^{3} + 36 X^{2} Y^{3} Z + 48 X^{2} Y^{2} Z^{2} + 12 X Y^{4} Z + 36 X^{2} Y^{2} Z + 36 X Y^{3} Z + 12 X^{2} Y Z + 36 X Y^{2} Z + 12 X Y Z

Algorithm definition

The algorithm ⟨6×12×14:645⟩ 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