Description of fast matrix multiplication algorithm: ⟨2 × 3 × 25:125⟩
Algorithm type
[[1, 1, 1]$65,[1, 2, 1]$30,[1, 3, 1]$5,[2, 2, 2]$25]Algorithm definition
The algorithm ⟨2 × 3 × 25:125⟩ is the (Kronecker) tensor product of ⟨1 × 1 × 5:5⟩ with ⟨2 × 3 × 5:25⟩.
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