Description of fast matrix multiplication algorithm: ⟨6×12×12:560⟩

Algorithm type

32X4Y6Z6+48X2Y6Z6+192X2Y3Z3+288XY3Z332X4Y6Z648X2Y6Z6192X2Y3Z3288XY3Z332*X^4*Y^6*Z^6+48*X^2*Y^6*Z^6+192*X^2*Y^3*Z^3+288*X*Y^3*Z^3

Algorithm definition

The algorithm ⟨6×12×12:560⟩ is the (Kronecker) tensor product of ⟨2×2×2:7⟩ with ⟨3×6×6:80⟩.

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