# Description of fast matrix multiplication algorithm: ⟨2×12×15:278⟩

# Algorithm type

[[1, 1, 1]$103,[1, 2, 1]$29,[1, 3, 1]$13,[1, 4, 1]$7,[1, 5, 1]$8,[1, 6, 1]$11,[1, 7, 1]$8,[1, 8, 1]$8,[1, 9, 1]$6,[1, 10, 1]$3,[2, 2, 2]$37,[2, 3, 2]$24,[2, 4, 2]$9,[2, 5, 2]$8,[2, 6, 2]$3,[2, 7, 2]$1]# Algorithm definition

The algorithm ⟨2×12×15:278⟩ 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*