On the public citation graph
Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication
0 signed · 29 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01294256openalex-snapshot
Lower bounds on arithmetic circuits via partial derivatives
inferredcites →https://doi.org/10.1007/bf01744431openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1007/s00037-008-0254-0openalex-snapshot
Balancing Syntactically Multilinear Arithmetic Circuits
inferredcites →https://doi.org/10.1007/s00037-009-0270-8openalex-snapshot
Lower Bounds and Separations for Constant Depth Multilinear Circuits
inferredcites →https://doi.org/10.1016/j.jco.2006.09.006openalex-snapshot
Characterizing Valiant's algebraic complexity classes
inferredcites →https://doi.org/10.1016/j.tcs.2012.03.041openalex-snapshot
Arithmetic circuits: The chasm at depth four gets wider
inferredcites →https://doi.org/10.1561/0400000039openalex-snapshot
Arithmetic Circuits: A Survey of Recent Results and Open Questions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00037-018-0171-9openalex-snapshot
Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.10.047openalex-snapshot
Lower bounds for special cases of syntactic multilinear ABPs
inferred← citeshttps://doi.org/10.1109/focs.2014.15openalex-snapshot
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00087openalex-snapshot
Learning sums of powers of low-degree polynomials in the non-degenerate case
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00083openalex-snapshot
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
inferred← citeshttps://doi.org/10.1137/140999220openalex-snapshot
The Limits of Depth Reduction for Arithmetic Formulas: It's All About the Top Fan-In
inferred← citeshttps://doi.org/10.1145/2591796.2591823openalex-snapshot
Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas
inferred← citeshttps://doi.org/10.1145/2591796.2591827openalex-snapshot
The limits of depth reduction for arithmetic formulas
inferred← citeshttps://doi.org/10.1145/3460952openalex-snapshot
On Computing Multilinear Polynomials Using Multi- r -ic Depth Four Circuits
inferred← citeshttps://doi.org/10.1145/3611094openalex-snapshot
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
inferred← citeshttps://doi.org/10.1145/3689957openalex-snapshot
Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2021.14openalex-snapshot
Functional Lower Bounds for Restricted Arithmetic Circuits of Depth Four
inferred← citeshttps://doi.org/10.48550/arxiv.1710.09502openalex-snapshot
Barriers for Rank Methods in Arithmetic Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.2006.02374openalex-snapshot
On tensor rank and commuting matrices
inferred← citeshttps://doi.org/10.48550/arxiv.2007.07496openalex-snapshot
Observations on Symmetric Circuits
inferred← citeshttps://doi.org/10.70675/9c6c6a19z65bdz4aa2zbb8bz8326795242dbopenalex-snapshot
Lower bounds and reconstruction algorithms for sums of affine powers
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.