|Title:||On the 2x2 Matrix Multiplication
|Authors:||Nader H. Bshouty
|Abstract:||In [SIAM J. Comput, June 1976] Probert proved that 15 additive operations are necessary and sufficient to multiply two 2 x 2 matrices over the binary field by a bilinear algorithms using 7 non-scalar multiplications. We prove this result for arbitrary field. We also use the algorithm of Winograd to classify all such algorithms.|
|Copyright||The 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 (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1989/CS/CS0574), 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