The matrix multiplication infix operator (*) produces a new matrix by performing matrix multiplication. The first matrix must have the same number of columns as the second matrix has rows.

This paper develops an algorithm to multiply a p × 2 matrix by a 2 × n matrix in $\lceil (3pn + \max (n, p))/2\rceil$ multiplications without use of commutativity of matrix elements. The algorithm ...

DeepMind’s paper also pointed out that AlphaTensor discovers a richer space of matrix multiplication algorithms than previously thought — up to thousands for each size.