Description of fast matrix multiplication algorithm: ⟨2×2×3:11⟩

Algorithm type

X2Y2Z2+10XYZX2Y2Z210XYZX^2*Y^2*Z^2+10*X*Y*Z

Algorithm definition

The algorithm ⟨2×2×3:11⟩ is taken from:

Hopcroft and Kerr 1971 [DOI]

Algorithm description

Algorithm symmetries

The following group of 8 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