On the public citation graph
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
0 signed · 44 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/bf01436566openalex-snapshot
Die Berechnungskomplexit�t von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
inferredcites →https://doi.org/10.1007/s00037-005-0188-8openalex-snapshot
Deterministic polynomial identity testing in non-commutative models
inferredcites →https://doi.org/10.1016/0304-3975(83)90110-xopenalex-snapshot
The complexity of partial derivatives
inferredcites →https://doi.org/10.1145/382242.382836openalex-snapshot
How to compute fast a function and all its derivatives
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-319-05446-9_4openalex-snapshot
Algebraic Complexity Classes
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-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-20712-9_31openalex-snapshot
Recent Results on Polynomial Identity Testing
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/s00037-013-0072-xopenalex-snapshot
Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits
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-015-0105-8openalex-snapshot
Read-once polynomial identity testing
inferred← citeshttps://doi.org/10.1007/s00037-016-0131-1openalex-snapshot
Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas
inferred← citeshttps://doi.org/10.1007/s00493-016-3460-4openalex-snapshot
Black-Box Identity Testing of Depth-4 Multilinear Circuits
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.1016/j.ipl.2019.105900openalex-snapshot
Slightly improved lower bounds for homogeneous formulas of bounded depth and bounded individual degree
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/focs.2013.34openalex-snapshot
Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs
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.1137/110824516openalex-snapshot
Deterministic Identity Testing of Depth-4 Multilinear Circuits with Bounded Top Fan-in
inferred← citeshttps://doi.org/10.1137/18m1191567openalex-snapshot
Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications
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/2213977.2214034openalex-snapshot
Separating multilinear branching programs and formulas
inferred← citeshttps://doi.org/10.1145/2213977.2214035openalex-snapshot
Reconstruction of depth-4 multilinear circuits with top fan-in 2
inferred← citeshttps://doi.org/10.1145/2535928openalex-snapshot
Tensor-Rank and Lower Bounds for Arithmetic Formulas
inferred← citeshttps://doi.org/10.1145/2591796.2591816openalex-snapshot
Hitting sets for multilinear read-once algebraic branching programs, in any order
inferred← citeshttps://doi.org/10.1145/2591796.2591847openalex-snapshot
A super-polynomial lower bound for regular arithmetic formulas
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/3357713.3384328openalex-snapshot
A robust version of Hegedus’s lemma, with applications
inferred← citeshttps://doi.org/10.1145/3460952openalex-snapshot
On Computing Multilinear Polynomials Using Multi- r -ic Depth Four Circuits
inferred← citeshttps://doi.org/10.1561/0400000039openalex-snapshot
Arithmetic Circuits: A Survey of Recent Results and Open Questions
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2015.304openalex-snapshot
Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2019.78openalex-snapshot
Towards Optimal Depth Reductions for Syntactically Multilinear Circuits
inferred← citeshttps://doi.org/10.46298/theoretics.23.5openalex-snapshot
A Robust Version of Heged\H{u}s's Lemma, with Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1309.5668openalex-snapshot
Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order
inferred← citeshttps://doi.org/10.48550/arxiv.1803.05933openalex-snapshot
Some Closure Results for Polynomial Factorization and Applications
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.