Description of fast matrix multiplication algorithm: ⟨18 × 24 × 30:7000⟩
Algorithm type
[[3, 3, 1]$1872,[3, 3, 2]$2112,[3, 3, 3]$144,[3, 3, 4]$576,[3, 3, 6]$96,[6, 6, 2]$1032,[6, 6, 4]$832,[6, 6, 6]$24,[6, 6, 8]$96,[6, 6, 12]$16,[12, 12, 4]$120,[12, 12, 8]$80]Algorithm definition
The algorithm ⟨18 × 24 × 30:7000⟩ is the (Kronecker) tensor product of ⟨3 × 2 × 5:25⟩ with ⟨6 × 12 × 6:280⟩.
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