Description of fast matrix multiplication algorithm: ⟨27×27×27:10234⟩

Algorithm type

[[1, 1, 1]$106,[1, 1, 2]$155,[1, 1, 3]$1248,[1, 2, 1]$29,[1, 2, 2]$12,[1, 3, 1]$25,[2, 1, 1]$41,[2, 1, 2]$26,[2, 1, 3]$12,[2, 2, 1]$93,[2, 2, 2]$460,[2, 2, 3]$276,[2, 3, 1]$75,[2, 3, 2]$876,[3, 1, 1]$12,[3, 1, 2]$312,[3, 2, 1]$88,[3, 2, 2]$588,[3, 2, 3]$288,[3, 3, 1]$1200,[3, 3, 3]$4312]

Algorithm definition

Algorithm description

maple tensor representation (compressed by bzip2);
maple evaluation scheme (compressed by bzip2).

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