A Lower Bound for Matrix Multiplication
From MaRDI portal
Publication:4203811
DOI10.1137/0218052zbMath0685.68035OpenAlexW1967361897MaRDI QIDQ4203811
Publication date: 1989
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0218052
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Quadratic and bilinear forms, inner products (15A63) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items (4)
Multiplicative complexity of direct sums of quadratic systems ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ Entropy of operators or why matrix multiplication is hard for depth-two circuits ⋮ Beyond the Alder-Strassen bound.
This page was built for publication: A Lower Bound for Matrix Multiplication