Fast Matrix Multiplication Without Tears: A Constraint Programming Approach

Arnaud Deza, Chang Liu, Pashootan Vaezipoor +1

It is known that the multiplication of an $N\times M$ matrix with an $M\times P$ matrix can be performed using fewer multiplications than what the naive $NMP$ approach suggests.…