On the public citation graph
https://doi.org/10.4086/toc.2006.v002a006
0 signed · 88 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/978-3-662-03338-8openalex-snapshot
Algebraic Complexity Theory
inferredcites →https://doi.org/10.1007/bf01294256openalex-snapshot
Lower bounds on arithmetic circuits via partial derivatives
inferredcites →https://doi.org/10.1109/focs.2004.42openalex-snapshot
Multilinear- NC₁ ≠ Multilinear- NC₂
inferredcites →https://doi.org/10.1109/sfcs.1995.492458openalex-snapshot
Lower bounds on arithmetic circuits via partial derivatives
inferredcites →https://doi.org/10.1137/0208010openalex-snapshot
On the Parallel Evaluation of Multivariate Polynomials
inferredcites →https://doi.org/10.1137/0212043openalex-snapshot
Fast Parallel Computation of Polynomials Using Few Processors
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/1007352.1007378openalex-snapshot
Multilinear formulas and skepticism of quantum computing
inferredcites →https://doi.org/10.1145/103418.103462openalex-snapshot
Lower bounds for non-commutative computation
inferredcites →https://doi.org/10.1145/800133.804347openalex-snapshot
On the parallel evaluation of multivariate polynomials
inferredcites →https://doi.org/10.1146/annurev.cs.03.060188.001533openalex-snapshot
Algebraic Complexity Theory
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-030-79416-3_9openalex-snapshot
Limitations of Sums of Bounded Read Formulas and ABPs
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-319-94776-1_58openalex-snapshot
Lower Bounds for Special Cases of Syntactic Multilinear ABPs
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_33openalex-snapshot
Lower Bounds for Syntactically Multilinear Algebraic Branching Programs
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-13182-0_21openalex-snapshot
Balancing Bounded Treewidth Circuits
inferred← citeshttps://doi.org/10.1007/978-3-642-13562-0_7openalex-snapshot
Algebraic Proofs over Noncommutative Formulas
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-48054-0_27openalex-snapshot
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials
inferred← citeshttps://doi.org/10.1007/s00037-008-0254-0openalex-snapshot
Balancing Syntactically Multilinear Arithmetic Circuits
inferred← citeshttps://doi.org/10.1007/s00037-009-0270-8openalex-snapshot
Lower Bounds and Separations for Constant Depth Multilinear Circuits
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/s00037-022-00223-8openalex-snapshot
Quadratic Lower Bounds for Algebraic Branching Programs and Formulas
inferred← citeshttps://doi.org/10.1007/s00037-025-00283-6openalex-snapshot
Towards Optimal Depth-Reductions for Algebraic Formulas
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/s00224-013-9519-3openalex-snapshot
Balancing Bounded Treewidth Circuits
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.apal.2008.04.001openalex-snapshot
Resolution over linear equations and multilinear proofs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.09.023openalex-snapshot
Notes on Boolean read- k and multilinear circuits
inferred← citeshttps://doi.org/10.1016/j.ic.2011.07.004openalex-snapshot
Algebraic proofs over noncommutative formulas
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.08.004openalex-snapshot
VNP = VP in the multilinear world
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.1016/j.jcss.2010.06.013openalex-snapshot
Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors
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/ccc.2008.8openalex-snapshot
Lower Bounds and Separations for Constant Depth Multilinear Circuits
inferred← citeshttps://doi.org/10.1109/focs.2007.13openalex-snapshot
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
inferred← citeshttps://doi.org/10.1109/focs.2007.6openalex-snapshot
48th Annual IEEE Symposium on Foundations of Computer Science - TOC
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.2014.15openalex-snapshot
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas
inferred← citeshttps://doi.org/10.1109/focs.2015.35openalex-snapshot
Deterministic Divisibility Testing via Shifted Partial Derivatives
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/070707932openalex-snapshot
A Lower Bound for the Size of Syntactically Multilinear Arithmetic 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/140990280openalex-snapshot
Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication
inferred← citeshttps://doi.org/10.1137/151002423openalex-snapshot
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas
inferred← citeshttps://doi.org/10.1137/16m1107632openalex-snapshot
Characterizing Propositional Proofs as Noncommutative Formulas
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/1007352.1007353openalex-snapshot
Multi-linear formulas for permanent and determinant are of super-polynomial size
inferred← citeshttps://doi.org/10.1145/1374376.1374479openalex-snapshot
Elusive functions and lower bounds for arithmetic circuits
inferred← citeshttps://doi.org/10.1145/1806689.1806780openalex-snapshot
Tensor-rank and lower bounds for arithmetic formulas
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.2591823openalex-snapshot
Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas
inferred← citeshttps://doi.org/10.1145/2591796.2591824openalex-snapshot
Lower bounds for depth 4 formulas computing iterated matrix multiplication
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/3055399.3055496openalex-snapshot
Succinct hitting sets and barriers to proving algebraic circuits lower bounds
inferred← citeshttps://doi.org/10.1145/3369928openalex-snapshot
Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth-three Circuits
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/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.4230/lipics.ccc.2015.304openalex-snapshot
Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas
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.fsttcs.2021.14openalex-snapshot
Functional Lower Bounds for Restricted Arithmetic Circuits of Depth Four
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2021.44openalex-snapshot
Circuit Lower Bounds, Help Functions, and the Remote Point Problem
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.1504.06213openalex-snapshot
Sums of products of polynomials in few variables : lower bounds and polynomial identity testing
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.1804.08810openalex-snapshot
Lower Bounds for Special Cases of Syntactic Multilinear ABPs
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
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.