Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
All Pairs Shortest Paths in Undirected Graphs with Integer Weights
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Lower Bounds for Matrix Product
SIAM Journal on Computing
General context-free recognition in less than cubic time
Journal of Computer and System Sciences
Multiplying matrices faster than coppersmith-winograd
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
The exponent ω of matrix multiplication is the infimum over all real numbers c such that for all ε 0 there is an algorithm that multiplies n - n matrices using at most O(nc+ε) arithmetic operations over an arbitrary field. A trivial lower bound on ω is 2, and the best known upper bound until recently was ω