On the public citation graph

Partial Derivatives in Arithmetic Complexity and Beyond

0 signed · 82 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.1006/eujc.1993.1022openalex-snapshot
Apolarity and Canonical Forms for Homogeneous Polynomials
inferredcites →https://doi.org/10.1006/jabr.1995.1024openalex-snapshot
On the Jacobian Conjecture: Reduction of Coefficients
inferredcites →https://doi.org/10.1006/jcom.1997.0439openalex-snapshot
Decoding of Reed Solomon Codes beyond the Error-Correction Bound
inferredcites →https://doi.org/10.1006/jnth.1996.0078openalex-snapshot
A Note on Simultaneous Congruences
inferredcites →https://doi.org/10.1006/jnth.1999.2381openalex-snapshot
Reducibility of Polynomialsf(x, y) Modulop
inferredcites →https://doi.org/10.1007/978-1-4757-3849-0openalex-snapshot
Algebraic Geometry
inferredcites →https://doi.org/10.1007/978-3-540-33275-6_15openalex-snapshot
Reducing the number of variables of a polynomial
inferredcites →https://doi.org/10.1007/978-3-662-03338-8openalex-snapshot
Algebraic Complexity Theory
inferredcites →https://doi.org/10.1007/978-3-662-36434-5openalex-snapshot
Moderne Algebra
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/bf01695502openalex-snapshot
Ganze Cremona-Transformationen
inferredcites →https://doi.org/10.1007/bf02165411openalex-snapshot
Gaussian elimination is not optimal
inferredcites →https://doi.org/10.1007/pl00001609openalex-snapshot
Depth-3 arithmetic circuits over fields of characteristic zero
inferredcites →https://doi.org/10.1007/s00037-004-0182-6openalex-snapshot
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
inferredcites →https://doi.org/10.1007/s00037-007-0226-9openalex-snapshot
Polynomial Identity Testing for Depth 3 Circuits
inferredcites →https://doi.org/10.1007/s00037-009-0258-4openalex-snapshot
Extractors And Rank Extractors For Polynomial Sources
inferredcites →https://doi.org/10.1007/s00454-010-9246-3openalex-snapshot
On Lines and Joints
inferredcites →https://doi.org/10.1016/0020-0190(84)90018-8openalex-snapshot
On computing the determinant in small parallel time using a small number of processors
inferredcites →https://doi.org/10.1016/0024-3795(87)90337-5openalex-snapshot
Permanent and determinant
inferredcites →https://doi.org/10.1016/0024-3795(89)90465-5openalex-snapshot
On two extremal matrix problems
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1016/0304-3975(83)90110-xopenalex-snapshot
The complexity of partial derivatives
inferredcites →https://doi.org/10.1016/0890-5401(90)90036-hopenalex-snapshot
A note on the determinant and permanent problem
inferredcites →https://doi.org/10.1016/j.ipl.2008.09.029openalex-snapshot
Deterministically testing sparse polynomial identities of unbounded degree
inferredcites →https://doi.org/10.1016/s0022-0000(02)00021-1openalex-snapshot
Affine projections of symmetric polynomials
inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1016/s0747-7171(08)80018-1openalex-snapshot
Interpolating polynomials from their values
inferredcites →https://doi.org/10.1017/cbo9780511623660openalex-snapshot
Classical Invariant Theory
inferredcites →https://doi.org/10.1017/s0305004100003455openalex-snapshot
A ‘Waring's problem’ for homogeneous forms
inferredcites →https://doi.org/10.1080/0025570x.1994.11996185openalex-snapshot
Sums of Like Powers of Multivariate Linear Forms
inferredcites →https://doi.org/10.1090/s0025-5718-02-01428-xopenalex-snapshot
Factoring multivariate polynomials via partial differential equations
inferredcites →https://doi.org/10.1090/s0894-0347-08-00607-3openalex-snapshot
On the size of Kakeya sets in finite fields
inferredcites →https://doi.org/10.1109/18.782097openalex-snapshot
Improved decoding of Reed-Solomon and algebraic-geometry codes
inferredcites →https://doi.org/10.1109/focs.2009.67openalex-snapshot
Blackbox Polynomial Identity Testing for Depth 3 Circuits
inferredcites →https://doi.org/10.1137/0204037openalex-snapshot
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
inferredcites →https://doi.org/10.1137/0205040openalex-snapshot
Fast Parallel Matrix Inversion Algorithms
inferredcites →https://doi.org/10.1137/0212043openalex-snapshot
Fast Parallel Computation of Polynomials Using Few Processors
inferredcites →https://doi.org/10.1137/080718115openalex-snapshot
Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties
inferredcites →https://doi.org/10.1137/s009753970038715xopenalex-snapshot
Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems
inferredcites →https://doi.org/10.1137/s0097539794282930openalex-snapshot
Lower Bounds in a Parallel Model without Bit Operations
inferredcites →https://doi.org/10.1137/s0097539798341600openalex-snapshot
Reducing Randomness via Irrational Numbers
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/1490270.1490272openalex-snapshot
Algebrization
inferredcites →https://doi.org/10.1145/1711475.1711487openalex-snapshot
Guest column
inferredcites →https://doi.org/10.1145/1993636.1993660openalex-snapshot
High-rate codes with sublinear-time decoding
inferredcites →https://doi.org/10.1145/322217.322225openalex-snapshot
Fast Probabilistic Algorithms for Verification of Polynomial Identities
inferredcites →https://doi.org/10.1145/382242.382836openalex-snapshot
How to compute fast a function and all its derivatives
inferredcites →https://doi.org/10.1145/792538.792540openalex-snapshot
Primality and identity testing via Chinese remaindering
inferredcites →https://doi.org/10.1155/s1073792804142566openalex-snapshot
inferredcites →https://doi.org/10.13001/1081-3810.1072openalex-snapshot
Berkowitz's algorithm and clow sequences
inferredcites →https://doi.org/10.5948/upo9781614440147openalex-snapshot
Combinatorial Mathematics

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-77886-6_12openalex-snapshot
Leakage-Resilience of the Shamir Secret-Sharing Scheme Against Physical-Bit Leakages
inferred← citeshttps://doi.org/10.1007/978-981-97-2340-9_30openalex-snapshot
Lower Bounds for the Sum of Small-Size Algebraic Branching Programs
inferred← citeshttps://doi.org/10.1007/s00037-022-00228-3openalex-snapshot
A Lower Bound on Determinantal Complexity
inferred← citeshttps://doi.org/10.1007/s00039-025-00724-yopenalex-snapshot
Oscillatory Integral Operators and Variable Schrödinger Propagators: Beyond the Universal Estimates
inferred← citeshttps://doi.org/10.1007/s10208-014-9216-xopenalex-snapshot
A $$\tau $$ τ -Conjecture for Newton Polygons
inferred← citeshttps://doi.org/10.1016/j.jsc.2025.102458openalex-snapshot
Geometric complexity theory for product-plus-power
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115214openalex-snapshot
Lower bounds for the sum of small-size algebraic branching programs
inferred← citeshttps://doi.org/10.1080/00927872.2016.1253706openalex-snapshot
Flattenings and Koszul Young flattenings arising in complexity theory
inferred← citeshttps://doi.org/10.1093/imrn/rnab208openalex-snapshot
The Almost Optimal Multilinear Restriction Estimate for Hypersurfaces with Curvature: The Case ofn-1Hypersurfaces in ℝn
inferred← citeshttps://doi.org/10.1109/focs.2013.68openalex-snapshot
Arithmetic Circuits: A Chasm at Depth Three
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.2014.20openalex-snapshot
Circuit Complexity, Proof Complexity, and Polynomial Identity Testing
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/focs54457.2022.00094openalex-snapshot
Polynomial-Time Power-Sum Decomposition of Polynomials
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/151002423openalex-snapshot
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas
inferred← citeshttps://doi.org/10.1137/16m1064738openalex-snapshot
Tropical Complexity, Sidon Sets, and Dynamic Programming
inferred← citeshttps://doi.org/10.1145/2213977.2214033openalex-snapshot
Jacobian hits circuits
inferred← citeshttps://doi.org/10.1145/3197406.3197416openalex-snapshot
Guest Column
inferred← citeshttps://doi.org/10.1145/3357713.3384257openalex-snapshot
Implementing geometric complexity theory: on the separation of orbit closures via symmetries
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/3618260.3649743openalex-snapshot
Learning the Coefficients: A Presentable Version of Border Complexity and Applications to Circuit Factoring
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/cjtcs.2019.002openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2011.v007a013openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2015.v011a011openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2016.v012a012openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2017.v013a006openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2019.v015a003openalex-snapshot
inferred← citeshttps://doi.org/10.4213/dm1714openalex-snapshot
О мультипликативной сложности многочленов
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.