Description of fast matrix multiplication algorithm: ⟨11×11×12:922⟩

Algorithm type

32 X^{4} Y^{6} Z^{6} + 32 X^{4} Y^{6} Z^{5} + 32 X^{4} Y^{5} Z^{6} + 48 X^{2} Y^{6} Z^{6} + 48 X^{2} Y^{6} Z^{5} + 48 X^{2} Y^{5} Z^{6} + 6 X^{8} Y^{2} Z^{2} + 64 X^{6} Y^{3} Z^{3} + 96 X^{3} Y^{3} Z^{3} + 96 X^{2} Y^{3} Z^{3} + 144 X Y^{3} Z^{3} + 36 X^{4} Y Z + 48 X^{2} Y^{2} Z^{2} + 48 X Y^{2} Z + 48 X Y Z^{2} + 96 X Y Z

Algorithm definition

The algorithm ⟨11×11×12:922⟩ 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