On the public citation graph

Approaching the Chasm at Depth Four

0 signed · 62 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.1007/978-0-387-35651-8openalex-snapshot
Ideals, Varieties, and Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-40313-2_71openalex-snapshot
Improved Bounds for Reduction to Depth 4 and Depth 3
inferredcites →https://doi.org/10.1007/bf01294256openalex-snapshot
Lower bounds on arithmetic circuits via partial derivatives
inferredcites →https://doi.org/10.1007/bf02571229openalex-snapshot
Gröbner bases and Stanley decompositions of determinantal rings
inferredcites →https://doi.org/10.1007/pl00001609openalex-snapshot
Depth-3 arithmetic circuits over fields of characteristic zero
inferredcites →https://doi.org/10.1007/s002009900021openalex-snapshot
Exponential Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions over Finite Fields
inferredcites →https://doi.org/10.1016/0021-8693(86)90134-1openalex-snapshot
The irreducibility of ladder determinantal varieties
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.1080/00029890.2000.12005235openalex-snapshot
Stirling's Approximation for n !: the Ultimate Short Proof?
inferredcites →https://doi.org/10.1080/00927879008824043openalex-snapshot
Ideals of generic minors
inferredcites →https://doi.org/10.1109/ccc.2008.8openalex-snapshot
Lower Bounds and Separations for Constant Depth Multilinear Circuits
inferredcites →https://doi.org/10.1109/ccc.2013.10openalex-snapshot
Random Arithmetic Formulas Can Be Reconstructed Efficiently
inferredcites →https://doi.org/10.1109/focs.2008.32openalex-snapshot
Arithmetic Circuits: A Chasm at Depth Four
inferredcites →https://doi.org/10.1145/1007352.1007353openalex-snapshot
Multi-linear formulas for permanent and determinant are of super-polynomial size
inferredcites →https://doi.org/10.1145/2213977.2214036openalex-snapshot
Affine projections of polynomials
inferredcites →https://doi.org/10.1145/2591796.2591824openalex-snapshot
Lower bounds for depth 4 formulas computing iterated matrix multiplication
inferredcites →https://doi.org/10.1145/2591796.2591847openalex-snapshot
A super-polynomial lower bound for regular arithmetic formulas
inferredcites →https://doi.org/10.1145/276698.276872openalex-snapshot
An exponential lower bound for depth 3 arithmetic circuits
inferredcites →https://doi.org/10.1145/3749740.3749750openalex-snapshot
Completeness Classes in Algebra
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/978-3-030-26176-4_15openalex-snapshot
On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models
inferred← citeshttps://doi.org/10.1007/978-3-319-32162-2_1openalex-snapshot
$$P\mathop{ =}\limits^{?}NP$$
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_71openalex-snapshot
Improved Bounds for Reduction to Depth 4 and Depth 3
inferred← citeshttps://doi.org/10.1007/978-3-662-55751-8_19openalex-snapshot
On $$\varSigma \wedge \varSigma \wedge \varSigma $$ Circuits: The Role of Middle $$\varSigma $$ Fan-In, Homogeneity and Bottom Degree
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.1007/s00037-019-00189-0openalex-snapshot
Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
inferred← citeshttps://doi.org/10.1007/s00037-021-00214-1openalex-snapshot
Lower Bounds for Arithmetic Circuits via the Hankel Matrix
inferred← citeshttps://doi.org/10.1007/s00493-019-4009-0openalex-snapshot
Unbalancing Sets and An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits
inferred← citeshttps://doi.org/10.1109/focs.2015.35openalex-snapshot
Deterministic Divisibility Testing via Shifted Partial Derivatives
inferred← citeshttps://doi.org/10.1109/focs.2019.00054openalex-snapshot
More Barriers for Rank Methods, via a "numeric to Symbolic" Transfer
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/140957123openalex-snapshot
Arithmetic Circuits: A Chasm at Depth 3
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.1137/18m1173319openalex-snapshot
The Computational Power of Depth Five Arithmetic Circuits
inferred← citeshttps://doi.org/10.1145/2852040.2852051openalex-snapshot
Complexity Theory Column 88
inferred← citeshttps://doi.org/10.1145/3055399.3055496openalex-snapshot
Succinct hitting sets and barriers to proving algebraic circuits lower bounds
inferred← citeshttps://doi.org/10.1145/3065470openalex-snapshot
Unexpected power of low-depth arithmetic circuits
inferred← citeshttps://doi.org/10.1145/3170709openalex-snapshot
Identity Testing and Lower Bounds for Read- k Oblivious Algebraic Branching Programs
inferred← citeshttps://doi.org/10.1145/3313232openalex-snapshot
Lower bounds for Sum and Sum of Products of Read-once 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/3519935.3520044openalex-snapshot
Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication
inferred← citeshttps://doi.org/10.1145/3544979.3544989openalex-snapshot
Guest Column
inferred← citeshttps://doi.org/10.1145/3611094openalex-snapshot
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
inferred← citeshttps://doi.org/10.1145/3618260.3649760openalex-snapshot
On the Power of Homogeneous Algebraic Formulas
inferred← citeshttps://doi.org/10.1145/3689957openalex-snapshot
Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits
inferred← citeshttps://doi.org/10.4086/toc.2015.v011a011openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2017.v013a006openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2017.v013a009openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2018.v014a016openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2018.v014a018openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2019.v015a013openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2021.v017a010openalex-snapshot
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2016.30openalex-snapshot
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2016.32openalex-snapshot
Proof Complexity Lower Bounds from Algebraic Circuit Complexity
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2016.33openalex-snapshot
Functional Lower Bounds for Arithmetic Circuits and Connections to Boolean Circuit Complexity
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2017.31openalex-snapshot
An Almost Cubic Lower Bound for Depth Three Arithmetic 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.1304.5777openalex-snapshot
Improved bounds for reduction to depth 4 and depth 3
inferred← citeshttps://doi.org/10.48550/arxiv.1803.05933openalex-snapshot
Some Closure Results for Polynomial Factorization and Applications
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
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.