The exponent of matrix multiplication

Part of the Lecture Notes in Computer Science book series (LNCS, volume 179)


The asymptotically fast algorithms for nXn matrix multiplication (MM) involving O(n2.496) arithmetical operations are designed with the demonstration of all major techniques historically used for the asymptotic acceleration of MM. The prospects of further progress are briefly discussed in Section 17.


Matrix Multiplication Correction Term Kronecker Product Recursive Algorithm Principal Term 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Personalised recommendations