On the public citation graph

Lower Bounds and Separations for Constant Depth Multilinear Circuits

0 signed · 38 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/bf01137685openalex-snapshot
Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
inferredcites →https://doi.org/10.1007/bf01436566openalex-snapshot
Die Berechnungskomplexit�t von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
inferredcites →https://doi.org/10.1007/bf01744431openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1007/pl00001609openalex-snapshot
Depth-3 arithmetic circuits over fields of characteristic zero
inferredcites →https://doi.org/10.1007/s00037-008-0254-0openalex-snapshot
Balancing Syntactically Multilinear Arithmetic Circuits
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/0168-0072(83)90038-6openalex-snapshot
∑11-Formulae on finite structures
inferredcites →https://doi.org/10.1109/ccc.1999.766267openalex-snapshot
Depth-3 arithmetic formulae over fields of characteristic zero
inferredcites →https://doi.org/10.1109/focs.2007.13openalex-snapshot
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
inferredcites →https://doi.org/10.1109/focs.2007.6openalex-snapshot
48th Annual IEEE Symposium on Foundations of Computer Science - TOC
inferredcites →https://doi.org/10.1109/sfcs.1985.49openalex-snapshot
Separating the polynomial-time hierarchy by oracles
inferredcites →https://doi.org/10.1109/sfcs.1991.185394openalex-snapshot
Lower bounds for polynomial evaluation and interpolation problems
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/103418.103462openalex-snapshot
Lower bounds for non-commutative computation
inferredcites →https://doi.org/10.1145/1374376.1374479openalex-snapshot
Elusive functions and lower bounds for arithmetic circuits
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
inferredcites →https://doi.org/10.4086/toc.2006.v002a006openalex-snapshot

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-43662-9_6openalex-snapshot
On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-03351-3_18openalex-snapshot
Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_52openalex-snapshot
Improved Polynomial Identity Testing for Read-Once Formulas
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_35openalex-snapshot
On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors
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-43948-7_62openalex-snapshot
Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits
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.1090/s0894-0347-2011-00694-2openalex-snapshot
Non-commutative circuits and the sum-of-squares problem
inferred← citeshttps://doi.org/10.1109/ccc.2009.19openalex-snapshot
A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent
inferred← citeshttps://doi.org/10.1109/focs.2018.00092openalex-snapshot
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits
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/1806689.1806779openalex-snapshot
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
inferred← citeshttps://doi.org/10.1145/1806689.1806780openalex-snapshot
Tensor-rank and lower bounds for arithmetic formulas
inferred← citeshttps://doi.org/10.1145/1806689.1806781openalex-snapshot
Non-commutative circuits and the sum-of-squares problem
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/2898437openalex-snapshot
Arithmetic Circuit Lower Bounds via Maximum-Rank of Partial Derivative Matrices
inferred← citeshttps://doi.org/10.1561/9781601984814openalex-snapshot
Partial Derivatives in Arithmetic Complexity and Beyond
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2016.30openalex-snapshot
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs
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.