A Lower Bound for Matrix Multiplication

Author:

Abstract
This paper proves that computing the product of two $n \times n$ matrices over the binary field requires at least $2.5n^2 - o(n^2 )$ multiplications.

This publication has 17 references indexed in Scilit: