Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Pan, V. (1984). The exponent of matrix multiplication. In: Pan, V. (eds) How to Multiply Matrices Faster. Lecture Notes in Computer Science, vol 179. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13866-8_10
Download citation
DOI: https://doi.org/10.1007/3-540-13866-8_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13866-2
Online ISBN: 978-3-540-39058-9
eBook Packages: Springer Book Archive