research-article

Multiplying matrices faster than coppersmith-winograd

Author:

Virginia Vassilevska WilliamsAuthors Info & Claims

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

Pages 887 - 898

https://doi.org/10.1145/2213977.2214056

Published: 19 May 2012 Publication History

Abstract

We develop an automated approach for designing matrix multiplication algorithms based on constructions similar to the Coppersmith-Winograd construction. Using this approach we obtain a new improved bound on the matrix multiplication exponent ω<2.3727.

Supplementary Material

JPG File (stoc_10_3.jpg)

Download
11.61 KB

MP4 File (stoc_10_3.mp4)

Download
150.26 MB

References

[1]

A. V. Aho, J. E. Hopcroft, and J. Ullman. The design and analysis of computer algorithms. Addison-Wesley Longman Publishing Co., Boston, MA, 1974.

Digital Library

[2]

N. Alon, A. Shpilka, and C. Umans. On sunflowers and matrix multiplication. ECCC TR11-067, 18, 2011.

[3]

F. A. Behrend. On the sets of integers which contain no three in arithmetic progression. Proc. Nat. Acad. Sci., pages 331--332, 1946.

[4]

D. Bini, M. Capovani, F. Romani, and G. Lotti. O(n^2.7799) complexity for n x n approximate matrix multiplication. Inf. Process. Lett., 8(5):234--235, 1979.

[5]

M. Blaser. Complexity of bilinear problems (lecture notes scribed by F. Endun). http://www-cc.cs.uni-saarland.de/teaching/SS09/ComplexityofBilinearProblems/script.pdf, 2009.

[6]

P. Bürgisser, M. Clausen, and M. A. Shokrollahi. Algebraic complexity theory, Grundlehren der mathematischen Wissenschaften. Springer-Verlag, Berlin, 1996.

Digital Library

[7]

H. Cohn, R. Kleinberg, B. Szegedy, and C. Umans. Group-theoretic algorithms for matrix multiplication. In Proc. FOCS, volume 46, pages 379--388, 2005.

Digital Library

[8]

H. Cohn and C. Umans. A group-theoretic approach to fast matrix multiplication. In Proc. FOCS, volume 44, pages 438--449, 2003.

Digital Library

[9]

D. Coppersmith and S. Winograd. On the asymptotic complexity of matrix multiplication. In Proc. SFCS, pages 82--90, 1981.

Digital Library

[10]

D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symbolic Computation, 9(3):251--280, 1990.

Digital Library

[11]

P. Erdös and R. Rado. Intersection theorems for systems of sets. J. London Math. Soc., 35:85--90, 1960.

[12]

F. Le Gall. Personal communication.

[13]

E. Mossel, R. O'Donnell, and R. A. Servedio. Learning juntas. In Proc. STOC, pages 206--212, 2003.

Digital Library

[14]

V. Y. Pan. Strassen's algorithm is not optimal. In Proc. FOCS, volume 19, pages 166--176, 1978.

Digital Library

[15]

F. Romani. Some properties of disjoint sums of tensors related to matrix multiplication. SIAM J. Comput., pages 263--267, 1982.

[16]

R. Salem and D. Spencer. On sets of integers which contain no three terms in arithmetical progression. Proc. Nat. Acad. Sci., 28(12):561--563, 1942.

[17]

A. Schönhage. Partial and total matrix multiplication. SIAM J. Comput., 10(3):434--455, 1981.

Digital Library

[18]

A. Stothers. Ph.D. Thesis, U. Edinburgh, 2010.

[19]

V. Strassen. Gaussian elimination is not optimal. Numer. Math., 13:354--356, 1969.

Digital Library

[20]

V. Strassen. Relative bilinear complexity and matrix multiplication. J. reine angew. Math. (Crelles Journal), 375--376:406--443, 1987.

[21]

L. G. Valiant. General context-free recognition in less than cubic time. Journal of Computer and System Sciences, 10:308--315, 1975.

Digital Library

Cited By

Zhao HFan AOuyang XKoutris P(2024)Conjunctive Queries with Negation and Aggregation: A Linear Time CharacterizationProceedings of the ACM on Management of Data10.1145/36511382:2(1-19)Online publication date: 14-May-2024
https://dl.acm.org/doi/10.1145/3651138
Feng YWang HZhu YLiu XLu HLiu Q(2024)DAWN: Matrix Operation-Optimized Algorithm for Shortest Paths Problem on Unweighted GraphsProceedings of the 38th ACM International Conference on Supercomputing10.1145/3650200.3656600(1-13)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3650200.3656600
Ren JSui YCheng XFeng YZhao J(2024)Dynamic Transitive Closure-based Static Analysis through the Lens of Quantum SearchACM Transactions on Software Engineering and Methodology10.1145/364438933:5(1-29)Online publication date: 4-Jun-2024
https://dl.acm.org/doi/10.1145/3644389
Show More Cited By

Index Terms

Multiplying matrices faster than coppersmith-winograd
1. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Stability of a method for multiplying complex matrices with three real matrix multiplications
Matrix Multiplication with Diagonals: Structured Sparse Matrices and Beyond
HP3C '23: Proceedings of the 2023 7th International Conference on High Performance Compilation, Computing and Communications

Matrix-matrix multiplication is a fundamental computation in a wide range of scientific problems. In this paper, we investigate algorithmic aspects of this important operation whereby the underlying arithmetic calculations are ordered in a way that is ...
Scalable task-based algorithm for multiplication of block-rank-sparse matrices
IA³ '15: Proceedings of the 5th Workshop on Irregular Applications: Architectures and Algorithms

A task-based formulation of Scalable Universal Matrix Multiplication Algorithm (SUMMA), a popular algorithm for matrix multiplication (MM), is applied to the multiplication of hierarchy-free, rank-structured matrices that appear in the domain of quantum ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

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

May 2012

1310 pages

ISBN:9781450312455

DOI:10.1145/2213977

General Chair:
Howard Karloff
AT&T Labs--Research
,
Program Chair:
Toniann Pitassi
University of Toronto

Copyright © 2012 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 May 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tag

matrix multiplication

Qualifiers

Research-article

Conference

STOC'12

Sponsor:

SIGACT

STOC'12: Symposium on Theory of Computing

May 19 - 22, 2012

New York, New York, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

486
Total Citations
View Citations
942
Total Downloads

Downloads (Last 12 months)148
Downloads (Last 6 weeks)13

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zhao HFan AOuyang XKoutris P(2024)Conjunctive Queries with Negation and Aggregation: A Linear Time CharacterizationProceedings of the ACM on Management of Data10.1145/36511382:2(1-19)Online publication date: 14-May-2024
https://dl.acm.org/doi/10.1145/3651138
Feng YWang HZhu YLiu XLu HLiu Q(2024)DAWN: Matrix Operation-Optimized Algorithm for Shortest Paths Problem on Unweighted GraphsProceedings of the 38th ACM International Conference on Supercomputing10.1145/3650200.3656600(1-13)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3650200.3656600
Ren JSui YCheng XFeng YZhao J(2024)Dynamic Transitive Closure-based Static Analysis through the Lens of Quantum SearchACM Transactions on Software Engineering and Methodology10.1145/364438933:5(1-29)Online publication date: 4-Jun-2024
https://dl.acm.org/doi/10.1145/3644389
Dey DGupta MMohar BShinkar IO'Donnell R(2024)Nearly Optimal Fault Tolerant Distance OracleProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649697(944-955)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649697
Dereziński MYang JMohar BShinkar IO'Donnell R(2024)Solving Dense Linear Systems Faster Than via PreconditioningProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649694(1118-1129)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649694
Björklund AKaski PMohar BShinkar IO'Donnell R(2024)The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both TrueProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649656(859-870)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649656
Zhou BWang XShen YFan P(2024)6-DoF Location-and-Pose Estimation Toward Integrated Visible Light Communication and Sensing: Algorithm Design and Performance LimitsIEEE Transactions on Signal Processing10.1109/TSP.2024.338328572(2576-2593)Online publication date: 2024
https://doi.org/10.1109/TSP.2024.3383285
Schwartz OToledo SVaknin NWiernik G(2024)Alternative Basis Matrix Multiplication is Fast and Stable2024 IEEE International Parallel and Distributed Processing Symposium (IPDPS)10.1109/IPDPS57955.2024.00013(38-51)Online publication date: 27-May-2024
https://doi.org/10.1109/IPDPS57955.2024.00013
Bernasconi ABerti ACorso GPoggiali A(2024)Quantum Subroutine for Efficient Matrix MultiplicationIEEE Access10.1109/ACCESS.2024.344617612(116274-116284)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3446176
Aldayel OAlmohimmah ERagheb AAlmaiman AAlshebeili S(2024)Joint Design of Autocorrelation and Spectral Characteristics of Radar WaveformsIEEE Access10.1109/ACCESS.2024.342786012(98075-98082)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3427860
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents