On the complexity of matrix product

DOI10.1145/509907.509932zbMath1192.68327OpenAlexW1999072436WikidataQ55879386 ScholiaQ55879386MaRDI QIDQ3579203

Ran Raz

Publication date: 5 August 2010

Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/509907.509932

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (9)

Alpha magnitude ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution ⋮ Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model ⋮ Factoring Block Fiedler Companion Matrices ⋮ Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth ⋮ A fast algorithm for all-pairs Hamming distances ⋮ Unnamed Item ⋮ Notes on discrete Gaussian scale space

This page was built for publication: On the complexity of matrix product