On the asymptotic complexity of matrix multiplication

Authors:
D. Coppersmith;S. Winograd
Affiliations:
-;-
Venue:
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
Year:
1981

Citing 0
Cited 5

An Efficient Algorithm for Identifying the Most Likely Fault Set in a Probabilistically Diagnosable System

IEEE Transactions on Computers - The MIT Press scientific computation series
An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems

IEEE Transactions on Computers
Selecting the most fitting resource for task execution

Future Generation Computer Systems
Polynomial curve fitting by substitution

Proceedings of the 8th FPGAWorld Conference
Multiplying matrices faster than coppersmith-winograd

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main results of this paper have the following flavor: given one algorithm for multiplying matrices, there exists another, better, algorithm. A consequence of these results is that ω, the exponent for matrix multiplication, is a limit point, that is, cannot be realized by any single algorithm. We also use these results to construct a new algorithm which shows that ω