Description of fast matrix multiplication algorithm: ⟨6×12×15:686⟩

Algorithm type

16 X^{4} Y^{9} Z^{6} + 16 X^{2} Y^{12} Z^{3} + 4 X^{2} Y^{9} Z^{6} + 32 X^{4} Y^{6} Z^{6} + 16 X^{2} Y^{7} Z^{6} + 4 X Y^{11} Z^{3} + 32 X^{2} Y^{9} Z^{3} + 2 X^{2} Y^{7} Z^{5} + 50 X^{2} Y^{6} Z^{6} + 4 X Y^{10} Z^{3} + 24 X Y^{9} Z^{3} + 4 X^{4} Y^{4} Z^{4} + 32 X^{3} Y^{6} Z^{2} + 40 X Y^{7} Z^{3} + 6 X^{3} Y^{6} Z + 4 X^{2} Y^{6} Z^{2} + 40 X^{3} Y^{5} Z + 3 X^{4} Y^{2} Z^{2} + 2 X^{3} Y^{4} Z + 2 X^{2} Y^{4} Z^{2} + 128 X^{2} Y^{3} Z^{3} + 3 X^{2} Y^{2} Z^{4} + 2 X Y^{6} Z + 192 X Y^{3} Z^{3} + 3 X^{2} Y^{3} Z + 11 X^{2} Y^{2} Z^{2} + 3 X Y^{3} Z^{2} + 11 X Y^{3} Z

Algorithm definition

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