This article is cited in 2 papers

On bilinear complexity of multiplcation of a $3\times 2$ matrix by a $2\times 3$ matrix

V. P. Burichenko

Institute of Mathematics of the National Academy of Sciences of Belarus, Minsk

Abstract: It is proved that the bilinear complexity of multiplication of a $3\times 2$ matrix by a $2\times 3$ matrix is equal to $15$, over any commutative ring. In other words, the well-known Hopcroft-Kerr scheme for multiplication of such matrices is optimal, for any domain of scalars.

Keywords: matrix multiplication, complexity.

UDC: 519.712.4+512.643

Received: 09.11.2023

DOI: 10.4213/dm1804