Description of fast matrix multiplication algorithm: ⟨18 × 24 × 24:5600⟩
Algorithm type
[[3, 3, 1]$1728,[3, 3, 2]$1152,[3, 3, 3]$576,[3, 3, 6]$384,[6, 6, 2]$864,[6, 6, 4]$576,[6, 6, 6]$96,[6, 6, 12]$64,[12, 12, 4]$96,[12, 12, 8]$64]Algorithm definition
The algorithm ⟨18 × 24 × 24:5600⟩ is the (Kronecker) tensor product of ⟨2 × 2 × 2:7⟩ with ⟨9 × 12 × 12:800⟩.
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