Multiplying matrices faster than coppersmith-winograd

Authors:
Virginia Vassilevska Williams
Affiliations:
UC Berkeley / Stanford University, Berkeley / Stanford, CA, USA
Venue:
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Year:
2012

Citing 9
Cited 31

Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Learning juntas

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A Group-Theoretic Approach to Fast Matrix Multiplication

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Group-theoretic Algorithms for Matrix Multiplication

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
On the asymptotic complexity of matrix multiplication

SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
General context-free recognition in less than cubic time

Journal of Computer and System Sciences
Algebraic Complexity Theory

Algebraic Complexity Theory

Optimal distributed all pairs shortest paths and applications

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Parsing Boolean grammars over a one-letter alphabet using online convolution

Theoretical Computer Science
Graph expansion and communication costs of fast matrix multiplication

Journal of the ACM (JACM)
Algorithms column: An overview of the recent progress on matrix multiplication by Virginia Vassilevska Williams

ACM SIGACT News
Exact exponential algorithms

Communications of the ACM
On the streaming complexity of computing local clustering coefficients

Proceedings of the sixth ACM international conference on Web search and data mining
Parameterized average-case complexity of the hypervolume indicator

Proceedings of the 15th annual conference on Genetic and evolutionary computation
Simultaneous computation of the row and column rank profiles

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Complexity estimates for two uncoupling algorithms

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
On the complexity of solving bivariate systems: the case of non-singular solutions

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Work-efficient matrix inversion in polylogarithmic time

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Fast approximation algorithms for the diameter and radius of sparse graphs

Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time

Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Compressed matrix multiplication

ACM Transactions on Computation Theory (TOCT) - Special issue on innovations in theoretical computer science 2012
On the inequivalence of bilinear algorithms for 3×3 matrix multiplication

Information Processing Letters
ProfileRank: finding relevant content and influential users based on information diffusion

Proceedings of the 7th Workshop on Social Network Mining and Analysis
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
How hard is counting triangles in the streaming model?

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Faster algorithms for markov decision processes with low treewidth

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Fast matrix rank algorithms and applications

Journal of the ACM (JACM)
Guessing singular dependencies

Journal of Symbolic Computation
Finding the minimum-weight k-path

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Linear-Time Approximation for Maximum Weight Matching

Journal of the ACM (JACM)
Communication costs of Strassen's matrix multiplication

Communications of the ACM
Modular Composition Modulo Triangular Sets and Applications

Computational Complexity
On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation

Theory of Computing Systems
A scalable approach to computing representative lowest common ancestor in directed acyclic graphs

Theoretical Computer Science
Parsing by matrix multiplication generalized to Boolean grammars

Theoretical Computer Science
Fast monotone summation over disjoint sets

Information Processing Letters
VLM Precoded SLM Technique for PAPR Reduction in OFDM Systems

Wireless Personal Communications: An International Journal
Computing the rooted triplet distance between galled trees by counting triangles

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.03

Visualization

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 ω