Description of fast matrix multiplication algorithm: ⟨25×25×25:8359⟩

Algorithm type

[[1, 1, 1]$98,[1, 1, 2]$143,[1, 1, 3]$1056,[1, 2, 1]$27,[1, 2, 2]$11,[1, 3, 1]$23,[2, 1, 1]$38,[2, 1, 2]$24,[2, 1, 3]$11,[2, 2, 1]$86,[2, 2, 2]$400,[2, 2, 3]$231,[2, 3, 1]$69,[2, 3, 2]$737,[3, 1, 1]$11,[3, 1, 2]$264,[3, 2, 1]$81,[3, 2, 2]$495,[3, 2, 3]$242,[3, 3, 1]$1012,[3, 3, 3]$3300]

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