Description of fast matrix multiplication algorithm: ⟨25×25×26:8498⟩

Algorithm type

[[1, 1, 1]$103,[1, 1, 2]$117,[1, 1, 3]$1131,[1, 2, 1]$26,[1, 2, 2]$12,[1, 3, 1]$22,[2, 1, 1]$2,[2, 1, 2]$27,[2, 1, 3]$22,[2, 2, 1]$109,[2, 2, 2]$433,[2, 2, 3]$254,[2, 3, 1]$69,[2, 3, 2]$716,[3, 1, 2]$11,[3, 2, 1]$69,[3, 2, 2]$265,[3, 2, 3]$462,[3, 3, 1]$1062,[3, 3, 3]$3586]

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