Description of fast matrix multiplication algorithm: ⟨12×16×16:1815⟩

Algorithm type

19X4Y6Z4+38X4Y5Z4+108X4Y4Z4+48X6Y2Z2+67X2Y6Z2+58X2Y4Z4+48X2Y2Z6+21X4Y3Z2+30X2Y5Z2+82X2Y3Z4+6X4Y2Z2+97X2Y4Z2+16X2Y2Z4+23XY6Z+70X2Y3Z2+5XY5Z+31XY4Z2+26XY2Z4+47X2Y3Z+264X2Y2Z2+18XY4Z+45XY3Z2+10XYZ4+96X3YZ+2X2Y2Z+9X2YZ2+121XY3Z+125XY2Z2+96XYZ3+5X2YZ+114XY2Z+45XYZ2+25XYZ19X4Y6Z438X4Y5Z4108X4Y4Z448X6Y2Z267X2Y6Z258X2Y4Z448X2Y2Z621X4Y3Z230X2Y5Z282X2Y3Z46X4Y2Z297X2Y4Z216X2Y2Z423XY6Z70X2Y3Z25XY5Z31XY4Z226XY2Z447X2Y3Z264X2Y2Z218XY4Z45XY3Z210XYZ496X3YZ2X2Y2Z9X2YZ2121XY3Z125XY2Z296XYZ35X2YZ114XY2Z45XYZ225XYZ19*X^4*Y^6*Z^4+38*X^4*Y^5*Z^4+108*X^4*Y^4*Z^4+48*X^6*Y^2*Z^2+67*X^2*Y^6*Z^2+58*X^2*Y^4*Z^4+48*X^2*Y^2*Z^6+21*X^4*Y^3*Z^2+30*X^2*Y^5*Z^2+82*X^2*Y^3*Z^4+6*X^4*Y^2*Z^2+97*X^2*Y^4*Z^2+16*X^2*Y^2*Z^4+23*X*Y^6*Z+70*X^2*Y^3*Z^2+5*X*Y^5*Z+31*X*Y^4*Z^2+26*X*Y^2*Z^4+47*X^2*Y^3*Z+264*X^2*Y^2*Z^2+18*X*Y^4*Z+45*X*Y^3*Z^2+10*X*Y*Z^4+96*X^3*Y*Z+2*X^2*Y^2*Z+9*X^2*Y*Z^2+121*X*Y^3*Z+125*X*Y^2*Z^2+96*X*Y*Z^3+5*X^2*Y*Z+114*X*Y^2*Z+45*X*Y*Z^2+25*X*Y*Z

Algorithm definition

The algorithm ⟨12×16×16:1815⟩ 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