# Description of fast matrix multiplication algorithm: ⟨2×6×6:56⟩

# Algorithm type

$3{X}^{2}{Y}^{4}{Z}^{2}+{X}^{2}{Y}^{4}Z+X{Y}^{5}Z+13{X}^{2}{Y}^{2}{Z}^{2}+8X{Y}^{4}Z+9X{Y}^{3}Z+4X{Y}^{2}Z+17XYZ$# Algorithm definition

The algorithm ⟨2×6×6:56⟩ is taken from:

Manuel Kauers and Jakob Moosbauer. Some New Non-Commutative Matrix Multiplication Algorithms of Size (n,m,6). Technical report, arXiv, June 2023. [ arXiv ] |

# 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*