A lower bound for matrix multiplication

It is proved that computing the product of two n*n matrices over the binary field requires at least 2.5n/sup 2/-O(n/sup 2/) multiplications.<<ETX>>

[1]  V. Strassen.  Gaussian elimination is not optimal , 1969 .

[2]  John E. Hopcroft,et al.  Some Techniques for Proving Certain Simple Programs Optimal , 1969, SWAT.

[3]  Abraham Lempel,et al.  On the Complexity of Multiplication in Finite Fields , 1983, Theor. Comput. Sci..

[4]  Volker Strassen,et al.  On the Algorithmic Complexity of Associative Algebras , 1981, Theor. Comput. Sci..

[5]  Michael Kaminski.  A Lower Bound for Polynomial Multiplication , 1985, Theor. Comput. Sci..

[6]  S. Winograd,et al.  A new approach to error-correcting codes , 1977, IEEE Trans. Inf. Theory.

[7]  David P. Dobkin,et al.  On the optimal evaluation of a set of bilinear forms , 1978 .

[8]  Werner Hartmann.  On the Multiplicative Complexity of Modules Over Associative Algebras , 1985, SIAM J. Comput..

[9]  Jacobus H. van Lint,et al.  Introduction to Coding Theory , 1982 .

[10]  David P. Dobkin,et al.  An Improved Lower Bound on Polynomial Multiplication , 1980, IEEE Transactions on Computers.

[11]  K. Ramachandra,et al.  Vermeidung von Divisionen. , 1973 .

[12]  John E. Hopcroft,et al.  Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms , 1973, SIAM J. Comput..

[13]  Shmuel Winograd,et al.  On multiplication of 2 × 2 matrices , 1971 .

[14]  Abraham Waksman.  On Winograd's Algorithm for Inner Products , 1970, IEEE Transactions on Computers.

[15]  Joseph JáJá,et al.  Improved Lower Bounds for Some Matrix Multiplication Problems , 1985, Inf. Process. Lett..

[16]  Joseph JáJá.  On the Complexity of Bilinear Forms with Commutativity , 1980, SIAM J. Comput..

[17]  Shmuel Winograd,et al.  A New Algorithm for Inner Product , 1968, IEEE Transactions on Computers.

[18]  L. R. Kerr,et al.  On Minimizing the Number of Multiplications Necessary for Matrix Multiplication , 1969 .

[19]  S. Winograd.  On the number of multiplications necessary to compute certain functions , 1970 .