On the public citation graph

A Lower Bound for Matrix Multiplication

https://doi.org/10.1137/0218052
0 signed · 42 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/cpa.3160230204openalex-snapshot
On the number of multiplications necessary to compute certain functions
inferredcites →https://doi.org/10.1007/978-3-7091-4325-4_1openalex-snapshot
Introduction to Coding Theory
inferredcites →https://doi.org/10.1007/bf02165411openalex-snapshot
Gaussian elimination is not optimal
inferredcites →https://doi.org/10.1016/0020-0190(85)90016-xopenalex-snapshot
Improved lower bounds for some matrix multiplication problems
inferredcites →https://doi.org/10.1016/0024-3795(71)90009-7openalex-snapshot
On multiplication of 2 × 2 matrices
inferredcites →https://doi.org/10.1016/0024-3795(78)90012-5openalex-snapshot
On the optimal evaluation of a set of bilinear forms
inferredcites →https://doi.org/10.1016/0304-3975(81)90070-0openalex-snapshot
On the algorithmic complexity of associative algebras
inferredcites →https://doi.org/10.1016/0304-3975(83)90108-1openalex-snapshot
On the complexity of multiplication in finite fields
inferredcites →https://doi.org/10.1016/0304-3975(85)90119-7openalex-snapshot
A lower bound for polynomial multiplication
inferredcites →https://doi.org/10.1109/t-c.1970.222926openalex-snapshot
On Winograd's Algorithm for Inner Products
inferredcites →https://doi.org/10.1109/tc.1968.227420openalex-snapshot
A New Algorithm for Inner Product
inferredcites →https://doi.org/10.1109/tc.1980.1675583openalex-snapshot
An Improved Lower Bound on Polynomial Multiplication
inferredcites →https://doi.org/10.1109/tit.1977.1055735openalex-snapshot
A new approach to error-correcting codes
inferredcites →https://doi.org/10.1137/0120004openalex-snapshot
On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
inferredcites →https://doi.org/10.1137/0202013openalex-snapshot
Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
inferredcites →https://doi.org/10.1137/0209056openalex-snapshot
On the Complexity of Bilinear Forms with Commutativity
inferredcites →https://doi.org/10.1137/0214029openalex-snapshot
On the Multiplicative Complexity of Modules over Associative Algebras

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-44693-1_9openalex-snapshot
A 5/2n 2-Lower Bound for the Multiplicative Complexity of n × n-Matrix Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-642-22685-4_12openalex-snapshot
Strong I/O Lower Bounds for Binomial and FFT Computation Graphs
inferred← citeshttps://doi.org/10.1007/pl00001605openalex-snapshot
Lower bounds for the bilinear complexity of associative algebras
inferred← citeshttps://doi.org/10.1007/s00037-006-0215-4openalex-snapshot
Polynomial multiplication over finite fields: from quadratic to straight-line complexity
inferred← citeshttps://doi.org/10.1007/s00224-008-9133-yopenalex-snapshot
Entropy of Operators or why Matrix Multiplication is Hard for Depth-Two Circuits
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90060-aopenalex-snapshot
Maximal bilinear complexity and codes
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.09.029openalex-snapshot
Beyond the Alder–Strassen bound
inferred← citeshttps://doi.org/10.1070/sm8833openalex-snapshot
Fast matrix multiplication and its algebraic neighbourhood
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959910openalex-snapshot
Lower bounds for matrix product
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814576openalex-snapshot
A 5/2n/sup 2/-lower bound for the rank of n×n-matrix multiplication over arbitrary fields
inferred← citeshttps://doi.org/10.1109/tit.2008.926346openalex-snapshot
Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication
inferred← citeshttps://doi.org/10.1137/0219031openalex-snapshot
Maximal Rank of $m\times n\times(mn-k)$ Tensors
inferred← citeshttps://doi.org/10.1137/05063605xopenalex-snapshot
Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
inferred← citeshttps://doi.org/10.1137/s009753970138462xopenalex-snapshot
Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates
inferred← citeshttps://doi.org/10.1137/s0097539702402147openalex-snapshot
On the Complexity of Matrix Product
inferred← citeshttps://doi.org/10.1137/s0097539702405954openalex-snapshot
Lower Bounds for Matrix Product
inferred← citeshttps://doi.org/10.1145/1060590.1060678openalex-snapshot
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
inferred← citeshttps://doi.org/10.1145/509907.509932openalex-snapshot
On the complexity of matrix product
inferred← citeshttps://doi.org/10.23919/date.2018.8342152openalex-snapshot
Rapid in-memory matrix multiplication using associative processor
inferred← citeshttps://doi.org/10.4213/sm8833openalex-snapshot
Быстрое умножение матриц и смежные вопросы алгебры
inferred← citeshttps://doi.org/10.48550/arxiv.1412.1145openalex-snapshot
Matrix Multiplication, Trilinear Decompositions, APA Algorithms, and Summation
inferred← citeshttps://doi.org/10.48550/arxiv.1612.05766openalex-snapshot
Fast Matrix Multiplication and Symbolic Computation
inferred← citeshttps://doi.org/10.48550/arxiv.1804.04102openalex-snapshot
Fast Feasible and Unfeasible Matrix Multiplication
inferred← citeshttps://doi.org/10.5281/zenodo.39403openalex-snapshot
Algorithms And Basis Functions In Tomographic Reconstruction Of Ionospheric Electron Density
inferred← citeshttps://doi.org/10.70675/09cf40c0z17a0z4efbz8c0fzb956e149d59copenalex-snapshot
Hardware Accelerators for Machine Learning Applications. Case Study : Autonomous Vehicles
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.