Description of fast matrix multiplication algorithm: ⟨3×6×30:400⟩
Algorithm type
Algorithm definition
The algorithm ⟨3×6×30:400⟩ is the (Kronecker) tensor product of ⟨1×1×5:5⟩ 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