Multiplying matrices faster than coppersmith-winograd

@inproceedings{Williams2012MultiplyingMF,
  title={Multiplying matrices faster than coppersmith-winograd},
  author={V. Williams},
  booktitle={STOC '12},
  year={2012}
}
  • V. Williams
  • Published in STOC '12 2012
  • Mathematics, Computer Science
  • 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. 
    843 Citations
    Fast Output-Sensitive Matrix Multiplication
    • 7
    • PDF
    Counting points on curves using a map to P1
    • J. Tuitman
    • Mathematics, Computer Science
    • Math. Comput.
    • 2016
    • 22
    • PDF
    An overview of the recent progress on matrix multiplication
    • 4
    • PDF
    Counting points on curves using a map to P1, II
    • J. Tuitman
    • Mathematics, Computer Science
    • Finite Fields Their Appl.
    • 2017
    • 20
    • Highly Influenced
    • PDF
    Simultaneous Conversions with the Residue Number System Using Linear Algebra
    • 4
    • PDF
    Matrix Multiplication , a Li le Faster Regular Submission
    • 1
    • PDF
    Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd Method
    • 35
    • Highly Influenced

    References

    SHOWING 1-10 OF 15 REFERENCES
    Matrix multiplication via arithmetic progressions
    • 1,246
    • Highly Influential
    • PDF
    Group-theoretic algorithms for matrix multiplication
    • Christopher Umans
    • Computer Science, Mathematics
    • 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
    • 2005
    • 152
    • Highly Influential
    • PDF
    On the Asymptotic Complexity of Matrix Multiplication
    • 211
    • Highly Influential
    Partial and Total Matrix Multiplication
    • 221
    • Highly Influential
    A group-theoretic approach to fast matrix multiplication
    • Henry Cohn, Christopher Umans
    • Mathematics, Computer Science
    • 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
    • 2003
    • 124
    • Highly Influential
    • PDF
    On Sunflowers and Matrix Multiplication
    • 20
    • Highly Influential
    • PDF
    Relative bilinear complexity and matrix multiplication.
    • 133
    • Highly Influential
    Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication
    • F. Romani
    • Mathematics, Computer Science
    • SIAM J. Comput.
    • 1982
    • 57
    • Highly Influential
    Algebraic complexity theory
    • 860
    • Highly Influential
    Gaussian elimination is not optimal
    • 2,242
    • Highly Influential
    • PDF