• DOI:10.1109/SFCS.1981.27
Corpus ID: 206558664

On the asymptotic complexity of matrix multiplication

@article{Coppersmith1981OnTA,
  title={On the asymptotic complexity of matrix multiplication},
  author={D. Coppersmith and S. Winograd},
  journal={22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)},
  year={1981},
  pages={82-90}
}

D. Coppersmith, S. Winograd

Published 1981

Mathematics, Computer Science

22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)

View on IEEE

doi.ieeecomputersociety.org

Save to Library

Create Alert

Cite

Launch Research Feed

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 ω ≪ 2.495364.