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 http://link.springer.de/link/service/series/0558/bibs/2010/20100099.htm db/conf/stacs/stacs2001.html#Blaser01