Description of fast matrix multiplication algorithm: ⟨6×7×9:264⟩

Algorithm type

6 X^{4} Y^{4} Z^{4} + 6 X^{4} Y^{3} Z^{4} + 6 X^{2} Y^{5} Z^{2} + 4 X^{2} Y^{3} Z^{4} + 8 X^{2} Y^{4} Z^{2} + 16 X^{2} Y^{2} Z^{4} + 15 X^{2} Y^{3} Z^{2} + 4 X^{2} Y Z^{4} + 30 X^{2} Y^{2} Z^{2} + X Y^{4} Z + 18 X Y^{3} Z^{2} + X^{2} Y^{2} Z + 4 X^{2} Y Z^{2} + 28 X Y^{3} Z + 20 X Y^{2} Z^{2} + 2 X^{2} Y Z + 39 X Y^{2} Z + 19 X Y Z^{2} + 37 X Y Z

Algorithm definition

The algorithm ⟨6×7×9:264⟩ 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