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

Algorithm type

8 X^{2} Y^{6} Z^{6} + 72 X^{4} Y^{4} Z^{4} + 24 X^{4} Y^{2} Z^{6} + 24 X^{2} Y^{6} Z^{4} + 36 X^{2} Y^{4} Z^{6} + 16 X^{2} Y^{5} Z^{4} + 24 X^{6} Y^{2} Z^{2} + 8 X^{6} Y Z^{3} + 36 X^{2} Y^{6} Z^{2} + 36 X^{2} Y^{2} Z^{6} + 32 X^{2} Y^{5} Z^{2} + 96 X^{4} Y^{2} Z^{2} + 32 X^{4} Y Z^{3} + 8 X^{3} Y^{2} Z^{3} + 8 X^{2} Y^{4} Z^{2} + 4 X^{3} Y Z^{3} + 32 X^{2} Y^{2} Z^{3} + 32 X Y^{3} Z^{3} + 162 X^{2} Y^{2} Z^{2} + 56 X^{2} Y Z^{3} + 80 X Y^{3} Z^{2} + 88 X Y^{2} Z^{3} + 14 X^{3} Y Z + 96 X Y^{3} Z + 16 X Y^{2} Z^{2} + 52 X Y Z^{3} + 56 X^{2} Y Z + 16 X Y^{2} Z + 70 X Y Z

Algorithm definition

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