A lower bound for $⟨3,2,m⟩$ matrix multiplication

Askar Tsyganov, Uliana Parkina, Sergey Samsonov +1

We prove that, over any field, the bilinear complexity of multiplying a $3\times 2$ matrix by a $2\times m$ matrix is strictly greater than $24m/5$. In particular, every exact bili…