Description of fast matrix multiplication algorithm: ⟨4×7×12:242⟩

Algorithm type

6⁢X4⁢Y4⁢Z4+4⁢X2⁢Y5⁢Z2+6⁢X2⁢Y4⁢Z2+20⁢X2⁢Y3⁢Z2+46⁢X2⁢Y2⁢Z2+9⁢X⁢Y4⁢Z+52⁢X⁢Y3⁢Z+47⁢X⁢Y2⁢Z+52⁢X⁢Y⁢Z6X4Y4Z44X2Y5Z26X2Y4Z220X2Y3Z246X2Y2Z29XY4Z52XY3Z47XY2Z52XYZ6*X^4*Y^4*Z^4+4*X^2*Y^5*Z^2+6*X^2*Y^4*Z^2+20*X^2*Y^3*Z^2+46*X^2*Y^2*Z^2+9*X*Y^4*Z+52*X*Y^3*Z+47*X*Y^2*Z+52*X*Y*Z

Algorithm definition

The algorithm ⟨4×7×12:242⟩ 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