Description of fast matrix multiplication algorithm: ⟨3×10×12:272⟩

Algorithm type

64X2Y3Z3+4X2Y3Z2+96XY3Z3+28X2Y2Z2+12XY2Z+28XYZ2+40XYZ64X2Y3Z34X2Y3Z296XY3Z328X2Y2Z212XY2Z28XYZ240XYZ64*X^2*Y^3*Z^3+4*X^2*Y^3*Z^2+96*X*Y^3*Z^3+28*X^2*Y^2*Z^2+12*X*Y^2*Z+28*X*Y*Z^2+40*X*Y*Z

Algorithm definition

The algorithm ⟨3×10×12:272⟩ is the (Kronecker) tensor product of ⟨3×10×6:136⟩ with ⟨1×1×2:2⟩.

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