A (5/2)n<sup>2</sup>-Lower Bound for the Multiplicative Complexity of n×n-Matrix Multiplication.

Markus Bläser A (5/2)n<sup>2</sup>-Lower Bound for the Multiplicative Complexity of n×n-Matrix Multiplication. 99-109 2001 conf/stacs/2001 STACS https://doi.org/10.1007/3-540-44693-1_9 db/conf/stacs/stacs2001.html#Blaser01