Lower Bounds for Matrix Product

DOI10.1137/S0097539702405954MaRDI QIDQ4429681zbMATH OpenFDO

Authors Amir Shpilka

Publication date 28 September 2003

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539702405954

zbMATH Keywords

linear codeslower boundsmatrix product

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• On the Complexity of Matrix Product
• On the complexity of the multiplication of matrices of small formats
• A Lower Bound for Matrix Multiplication
• Lower bounds for matrix product, in bounded depth circuits with arbitrary gates
• Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates

Cited in

(13)

• Bounds on certain multiplications of affine combinations
• A lower bound on determinantal complexity
• On a matrix product question in cryptography
• Lower bounds on the bounded coefficient complexity of bilinear maps
• A Lower Bound for Matrix Multiplication
• On the Complexity of Matrix Product
• Fast matrix multiplication and its algebraic neighbourhood
• Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates
• Lower bounds for matrix product, in bounded depth circuits with arbitrary gates
• scientific article; zbMATH DE number 7758331 (Why is no real title available?)
• A refined laser method and faster matrix multiplication
• Lower bounds for additive complexity of linear operators and bilinear algorithms for matrix and polynomial multiplication over GF(2)
• On matrix multiplication and polynomial identity testing

This page was built for publication: Lower Bounds for Matrix Product

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