On the public citation graph

Depth-3 arithmetic circuits over fields of characteristic zero

0 signed · 107 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-3-642-57956-1openalex-snapshot
Basic Algebraic Geometry 2
inferredcites →https://doi.org/10.1007/bf01137685openalex-snapshot
Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
inferredcites →https://doi.org/10.1016/0304-3975(83)90110-xopenalex-snapshot
The complexity of partial derivatives
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50016-3openalex-snapshot
Algebraic Complexity Theory
inferredcites →https://doi.org/10.1016/s0022-0000(02)00021-1openalex-snapshot
Affine projections of symmetric polynomials
inferredcites →https://doi.org/10.1017/cbo9780511987045openalex-snapshot
A Course in Combinatorics
inferredcites →https://doi.org/10.1090/s0002-9939-1966-0204305-9openalex-snapshot
A Certain Class of Incidence Matrices
inferredcites →https://doi.org/10.1109/sfcs.1998.743456openalex-snapshot
Exponential complexity lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields
inferredcites →https://doi.org/10.1145/103418.103462openalex-snapshot
Lower bounds for non-commutative computation
inferredcites →https://doi.org/10.1145/276698.276872openalex-snapshot
An exponential lower bound for depth 3 arithmetic circuits
inferredcites →https://doi.org/10.1145/28395.28404openalex-snapshot
Algebraic methods in the theory of lower bounds for Boolean circuit complexity

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-79416-3_9openalex-snapshot
Limitations of Sums of Bounded Read Formulas and ABPs
inferred← citeshttps://doi.org/10.1007/978-3-031-82697-9_10openalex-snapshot
Exact Characterizations of Non-commutative Algebraic Complexity Without Homogeneity
inferred← citeshttps://doi.org/10.1007/978-3-319-05446-9_5openalex-snapshot
A Selection of Lower Bounds for Arithmetic Circuits
inferred← citeshttps://doi.org/10.1007/978-3-319-22177-9_8openalex-snapshot
On the Expressive Power of Read-Once Determinants
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-540-45167-9_34openalex-snapshot
Learning Arithmetic Circuits via Partial Derivatives
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_6openalex-snapshot
Diagonal Circuit Identity Testing and Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_46openalex-snapshot
“Resistant” Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas
inferred← citeshttps://doi.org/10.1007/978-3-642-03351-3_17openalex-snapshot
Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_29openalex-snapshot
Uniform Derandomization from Pathetic Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_61openalex-snapshot
Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_56openalex-snapshot
Arithmetic Circuit Lower Bounds via MaxRank
inferred← citeshttps://doi.org/10.1007/978-3-662-44465-8_16openalex-snapshot
On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-662-48054-0_27openalex-snapshot
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials
inferred← citeshttps://doi.org/10.1007/s00037-007-0226-9openalex-snapshot
Polynomial Identity Testing for Depth 3 Circuits
inferred← citeshttps://doi.org/10.1007/s00037-008-0246-0openalex-snapshot
The Strength of Multilinear Proofs
inferred← citeshttps://doi.org/10.1007/s00037-009-0284-2openalex-snapshot
Quadratic Lower Bound for Permanent Vs. Determinant in any Characteristic
inferred← citeshttps://doi.org/10.1007/s00037-011-0007-3openalex-snapshot
Homogeneous Formulas and Symmetric Polynomials
inferred← citeshttps://doi.org/10.1007/s00037-011-0024-2openalex-snapshot
Small Space Analogues of Valiant’s Classes and the Limitations of Skew Formulas
inferred← citeshttps://doi.org/10.1007/s00037-015-0097-4openalex-snapshot
Deterministic polynomial identity tests for multilinear bounded-read formulae
inferred← citeshttps://doi.org/10.1007/s00037-015-0103-xopenalex-snapshot
Unifying Known Lower Bounds via Geometric Complexity Theory
inferred← citeshttps://doi.org/10.1007/s00037-016-0132-0openalex-snapshot
Lower Bounds for Depth-Three Arithmetic Circuits with small bottom fanin
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-022-00223-8openalex-snapshot
Quadratic Lower Bounds for Algebraic Branching Programs and Formulas
inferred← citeshttps://doi.org/10.1007/s00037-023-00236-xopenalex-snapshot
Schur Polynomials Do Not Have Small Formulas If the Determinant does not
inferred← citeshttps://doi.org/10.1007/s00037-025-00283-6openalex-snapshot
Towards Optimal Depth-Reductions for Algebraic Formulas
inferred← citeshttps://doi.org/10.1007/s00037-026-00286-xopenalex-snapshot
On Approximate Symmetric Polynomials and Tightness of Homogenization Results
inferred← citeshttps://doi.org/10.1007/s00224-010-9308-1openalex-snapshot
Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
inferred← citeshttps://doi.org/10.1007/s11565-014-0202-7openalex-snapshot
Geometric complexity theory: an introduction for geometers
inferred← citeshttps://doi.org/10.1016/j.apal.2008.04.001openalex-snapshot
Resolution over linear equations and multilinear proofs
inferred← citeshttps://doi.org/10.1016/j.ic.2012.10.013openalex-snapshot
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
inferred← citeshttps://doi.org/10.1016/j.ic.2017.04.007openalex-snapshot
On the limits of depth reduction at depth 3 over small finite fields
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.09.003openalex-snapshot
Monotone separations for constant degree polynomials
inferred← citeshttps://doi.org/10.1016/s0022-0000(02)00021-1openalex-snapshot
Affine projections of symmetric polynomials
inferred← citeshttps://doi.org/10.1017/9781108183192openalex-snapshot
Geometry and Complexity Theory
inferred← citeshttps://doi.org/10.1098/rsta.2011.0318openalex-snapshot
Uniform derandomization from pathetic lower bounds
inferred← citeshttps://doi.org/10.1109/ccc.2004.11openalex-snapshot
Deterministic polynomial identity testing in non commutative models
inferred← citeshttps://doi.org/10.1109/ccc.2004.1313845openalex-snapshot
Deterministic polynomial identity testing in non commutative models
inferred← citeshttps://doi.org/10.1109/ccc.2008.8openalex-snapshot
Lower Bounds and Separations for Constant Depth Multilinear Circuits
inferred← citeshttps://doi.org/10.1109/ccc.2009.18openalex-snapshot
Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in
inferred← citeshttps://doi.org/10.1109/ccc.2009.9openalex-snapshot
The Proof Complexity of Polynomial Identities
inferred← citeshttps://doi.org/10.1109/ccc.2011.28openalex-snapshot
Tensor Rank: Some Lower and Upper Bounds
inferred← citeshttps://doi.org/10.1109/ccc.2013.16openalex-snapshot
Approaching the Chasm at Depth Four
inferred← citeshttps://doi.org/10.1109/ccc.2014.23openalex-snapshot
Recent Progress on Lower Bounds for Arithmetic Circuits
inferred← citeshttps://doi.org/10.1109/focs.2009.67openalex-snapshot
Blackbox Polynomial Identity Testing for Depth 3 Circuits
inferred← citeshttps://doi.org/10.1109/focs.2012.15openalex-snapshot
Geometric Complexity Theory V: Equivalence between Blackbox Derandomization of Polynomial Identity Testing and Derandomization of Noether's Normalization Lemma
inferred← citeshttps://doi.org/10.1109/focs.2013.68openalex-snapshot
Arithmetic Circuits: A Chasm at Depth Three
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00083openalex-snapshot
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00025openalex-snapshot
Simple Hard Instances for Low-Depth Algebraic Proofs
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00026openalex-snapshot
Separated borders: Exponential-gap fanin-hierarchy theorem for approximative depth-3 circuits
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00138openalex-snapshot
Constant-Depth Arithmetic Circuits for Linear Algebra Problems
inferred← citeshttps://doi.org/10.1137/070694879openalex-snapshot
Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates
inferred← citeshttps://doi.org/10.1137/080735850openalex-snapshot
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits
inferred← citeshttps://doi.org/10.1137/130910725openalex-snapshot
Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ 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/24m1708085openalex-snapshot
Constant-Depth Arithmetic Circuits for Linear Algebra Problems
inferred← citeshttps://doi.org/10.1142/s1793557114500314openalex-snapshot
Types of depth and formula size
inferred← citeshttps://doi.org/10.1145/1007352.1007353openalex-snapshot
Multi-linear formulas for permanent and determinant are of super-polynomial size
inferred← citeshttps://doi.org/10.1145/1250790.1250833openalex-snapshot
Interpolation of depth-3 arithmetic circuits with two multiplication gates
inferred← citeshttps://doi.org/10.1145/1374376.1374446openalex-snapshot
A quadratic lower bound for the permanent and determinant problem over any characteristic ≠ 2
inferred← citeshttps://doi.org/10.1145/1374376.1374479openalex-snapshot
Elusive functions and lower bounds for arithmetic circuits
inferred← citeshttps://doi.org/10.1145/2213977.2214036openalex-snapshot
Affine projections of polynomials
inferred← citeshttps://doi.org/10.1145/2591796.2591827openalex-snapshot
The limits of depth reduction for arithmetic formulas
inferred← citeshttps://doi.org/10.1145/2591796.2591847openalex-snapshot
A super-polynomial lower bound for regular arithmetic formulas
inferred← citeshttps://doi.org/10.1145/2629541openalex-snapshot
Approaching the Chasm at Depth Four
inferred← citeshttps://doi.org/10.1145/2852040.2852051openalex-snapshot
Complexity Theory Column 88
inferred← citeshttps://doi.org/10.1145/2898437openalex-snapshot
Arithmetic Circuit Lower Bounds via Maximum-Rank of Partial Derivative Matrices
inferred← citeshttps://doi.org/10.1145/3065470openalex-snapshot
Unexpected power of low-depth arithmetic circuits
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/3313276.3316360openalex-snapshot
Reconstruction of non-degenerate homogeneous depth three 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.1561/0400000039openalex-snapshot
Arithmetic Circuits: A Survey of Recent Results and Open Questions
inferred← citeshttps://doi.org/10.1561/0400000043openalex-snapshot
Partial Derivatives in Arithmetic Complexity and Beyond
inferred← citeshttps://doi.org/10.1561/9781601984814openalex-snapshot
Partial Derivatives in Arithmetic Complexity and Beyond
inferred← citeshttps://doi.org/10.17863/cam.100142openalex-snapshot
Symmetric Arithmetic Circuits
inferred← citeshttps://doi.org/10.4086/toc.2006.v002a010openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2010.v006a007openalex-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.2019.v015a003openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2021.v017a010openalex-snapshot
inferred← citeshttps://doi.org/10.4171/022-3/48openalex-snapshot
Determinant versus permanent
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.34openalex-snapshot
Arithmetic Circuits with Locally Low Algebraic Rank
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2020.14openalex-snapshot
Schur Polynomials Do Not Have Small Formulas If the Determinant Doesn't
inferred← citeshttps://doi.org/10.48550/arxiv.1911.11793openalex-snapshot
A Quadratic Lower Bound for Algebraic Branching Programs and Formulas
inferred← citeshttps://doi.org/10.48550/arxiv.2010.01385openalex-snapshot
Limitations of Sums of Bounded-Read Formulas
inferred← citeshttps://doi.org/10.48550/arxiv.2110.07881openalex-snapshot
$k\texttt{-experts}$ -- Online Policies and Fundamental Limits
inferred← citeshttps://doi.org/10.5555/2833227.2833235openalex-snapshot
Lower bounds for depth three arithmetic circuits with small bottom fanin
inferred← citeshttps://doi.org/10.7282/t35d8qvqopenalex-snapshot
On circuit complexity classes and iterated matrix multiplication
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.