Description of fast matrix multiplication algorithm: ⟨5×6×9:193⟩

Algorithm type

5⁢X2⁢Y3⁢Z2+72⁢X2⁢Y2⁢Z2+X⁢Y3⁢Z2+X2⁢Y2⁢Z+X2⁢Y⁢Z2+4⁢X⁢Y3⁢Z+2⁢X⁢Y2⁢Z2+X⁢Y⁢Z3+16⁢X2⁢Y⁢Z+32⁢X⁢Y2⁢Z+29⁢X⁢Y⁢Z2+29⁢X⁢Y⁢Z5X2Y3Z272X2Y2Z2XY3Z2X2Y2ZX2YZ24XY3Z2XY2Z2XYZ316X2YZ32XY2Z29XYZ229XYZ5*X^2*Y^3*Z^2+72*X^2*Y^2*Z^2+X*Y^3*Z^2+X^2*Y^2*Z+X^2*Y*Z^2+4*X*Y^3*Z+2*X*Y^2*Z^2+X*Y*Z^3+16*X^2*Y*Z+32*X*Y^2*Z+29*X*Y*Z^2+29*X*Y*Z

Algorithm definition

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