Description of fast matrix multiplication algorithm: ⟨6×9×16:552⟩

Algorithm type

64 X^{2} Y^{8} Z^{3} + 28 X^{4} Y^{4} Z^{4} + 96 X Y^{8} Z^{3} + 4 X^{6} Y^{3} Z^{2} + 64 X^{2} Y^{6} Z^{3} + 12 X^{2} Y^{6} Z^{2} + 8 X^{2} Y^{4} Z^{4} + 8 X^{2} Y^{2} Z^{6} + 96 X Y^{6} Z^{3} + 3 X^{2} Y^{5} Z^{2} + 4 X Y^{7} Z + 2 X Y^{6} Z^{2} + 34 X^{2} Y^{4} Z^{2} + 16 X^{2} Y^{2} Z^{4} + 3 X Y^{6} Z + 4 X^{3} Y^{3} Z + 4 X^{2} Y^{3} Z^{2} + 5 X Y^{5} Z + 5 X Y^{4} Z^{2} + 4 X Y^{3} Z^{3} + 27 X^{2} Y^{2} Z^{2} + 11 X Y^{4} Z + 8 X Y^{3} Z^{2} + 2 X Y^{2} Z^{3} + 15 X Y^{3} Z + 2 X Y^{2} Z^{2} + 2 X Y Z^{3} + 4 X Y^{2} Z + 7 X Y Z^{2} + 10 X Y Z

Algorithm definition

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