Technical Report CS0579

Title: A Lower Bound for Matrix Multiplication
Authors: Nader H. Bshouty
Abstract: We prove that computing the product of two nXn matrices over the binary field requires at least 2.5n^2-o(n^2) multiplications.

Key Words: matrix multiplication, arithmetic complexity, lower bounds, linear codes.

CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (, rather than to the URL of the PDF files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 1989
To the main CS technical reports page

Computer science department, Technion