Algorithm type

[[1, 1, 1]\$502,[1, 2, 1]\$149,[1, 3, 1]\$26,[1, 4, 1]\$4,[1, 5, 1]\$2,[1, 6, 1]\$3,[1, 7, 1]\$4,[1, 8, 1]\$3,[1, 9, 1]\$5,[1, 10, 1]\$6,[1, 11, 1]\$6,[1, 12, 1]\$7,[1, 13, 1]\$4,[1, 14, 1]\$8,[1, 15, 1]\$5,[1, 16, 1]\$4,[1, 17, 1]\$3,[1, 18, 1]\$2,[1, 19, 1]\$3,[1, 20, 1]\$2,[1, 21, 1]\$3,[1, 22, 1]\$2,[1, 23, 1]\$2,[1, 24, 1]\$1,[2, 2, 2]\$186,[2, 3, 2]\$136,[2, 4, 2]\$26,[2, 5, 2]\$2]

Algorithm definition

The algorithm ⟨2 × 26 × 28:1106⟩ is taken from:

 John Edward Hopcroft and Leslie R. Kerr. On minimizing the number of multiplication necessary for matrix multiplication. SIAM Journal on Applied Mathematics, 20(1), January 1971. [DOI]

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