Description of fast matrix multiplication algorithm: ⟨6×9×12:429⟩

Algorithm type

12 X^{4} Y^{4} Z^{4} + 48 X^{2} Y^{3} Z^{6} + 24 X Y^{3} Z^{5} + 9 X^{4} Y^{2} Z^{2} + 6 X^{2} Y^{4} Z^{2} + 96 X^{2} Y^{3} Z^{3} + 9 X^{2} Y^{2} Z^{4} + 48 X Y^{3} Z^{4} + 144 X Y^{3} Z^{3} + 33 X^{2} Y^{2} Z^{2}

Algorithm definition

The algorithm ⟨6×9×12:429⟩ is taken from:

Andrew I. Perminov. FastMatrixMultiplication, GitHub, February 2026. [ GitHub repository ]

Algorithm description

maple tensor representation (compressed by bzip2);
maple LRP representation (compressed by bzip2);
maple evaluation scheme (compressed by bzip2).

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