Description of fast matrix multiplication algorithm: ⟨6×9×10:367⟩

Algorithm type

X4Y5Z4+X4Y5Z3+8X4Y4Z4+X4Y4Z3+32X2Y6Z3+X4Y4Z2+7X4Y3Z3+9X2Y6Z2+33X2Y5Z3+48XY6Z3+X4Y2Z3+3X2Y5Z2+2X2Y3Z4+40XY5Z3+12X4Y2Z2+X2Y3Z3+X2YZ5+8XY4Z3+3X2Y4Z+9X2Y3Z2+5X2Y2Z3+X2YZ4+X4YZ+23X2Y3Z+34X2Y2Z2+X2YZ3+X2Y2Z+4X2YZ2+18XY3Z+2XY2Z2+2XYZ3+18X2YZ+4XY2Z+4XYZ2+28XYZX4Y5Z4X4Y5Z38X4Y4Z4X4Y4Z332X2Y6Z3X4Y4Z27X4Y3Z39X2Y6Z233X2Y5Z348XY6Z3X4Y2Z33X2Y5Z22X2Y3Z440XY5Z312X4Y2Z2X2Y3Z3X2YZ58XY4Z33X2Y4Z9X2Y3Z25X2Y2Z3X2YZ4X4YZ23X2Y3Z34X2Y2Z2X2YZ3X2Y2Z4X2YZ218XY3Z2XY2Z22XYZ318X2YZ4XY2Z4XYZ228XYZX^4*Y^5*Z^4+X^4*Y^5*Z^3+8*X^4*Y^4*Z^4+X^4*Y^4*Z^3+32*X^2*Y^6*Z^3+X^4*Y^4*Z^2+7*X^4*Y^3*Z^3+9*X^2*Y^6*Z^2+33*X^2*Y^5*Z^3+48*X*Y^6*Z^3+X^4*Y^2*Z^3+3*X^2*Y^5*Z^2+2*X^2*Y^3*Z^4+40*X*Y^5*Z^3+12*X^4*Y^2*Z^2+X^2*Y^3*Z^3+X^2*Y*Z^5+8*X*Y^4*Z^3+3*X^2*Y^4*Z+9*X^2*Y^3*Z^2+5*X^2*Y^2*Z^3+X^2*Y*Z^4+X^4*Y*Z+23*X^2*Y^3*Z+34*X^2*Y^2*Z^2+X^2*Y*Z^3+X^2*Y^2*Z+4*X^2*Y*Z^2+18*X*Y^3*Z+2*X*Y^2*Z^2+2*X*Y*Z^3+18*X^2*Y*Z+4*X*Y^2*Z+4*X*Y*Z^2+28*X*Y*Z

Algorithm definition

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