Description of fast matrix multiplication algorithm: ⟨3×6×8:108⟩

Algorithm type

36X2Y2Z2+36X2YZ+36XY2Z36X2Y2Z236X2YZ36XY2Z36*X^2*Y^2*Z^2+36*X^2*Y*Z+36*X*Y^2*Z

Algorithm definition

The algorithm ⟨3×6×8:108⟩ is the (Kronecker) tensor product of ⟨1×1×2:2⟩ with ⟨3×6×4:54⟩.

Algorithm description

Algorithm symmetries

The following group of 2 isotropies acts as a permutation group on algorithm tensor representation:

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