On the complexity of matrix product

DOI10.1145/509907.509932MaRDI QIDQ3579203zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Cited in

(12)

• A fast algorithm for all-pairs Hamming distances
• Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth
• Notes on discrete Gaussian scale space
• 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
• Fast matrix multiplication and its algebraic neighbourhood
• scientific article; zbMATH DE number 7250166 (Why is no real title available?)
• Alpha magnitude
• Lower bounds for planar arithmetic circuits
• Lower bounds for planar arithmetic circuits
• Time-space trade-offs for sumcheck

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579203)