On the public citation graph
Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter
0 signed · 74 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.1006/jcss.1996.0017openalex-snapshot
Learning Sparse Multivariate Polynomials over a Field with Queries and Counterexamples
inferredcites →https://doi.org/10.1007/11590156_6openalex-snapshot
Proving Lower Bounds Via Pseudo-random Generators
inferredcites →https://doi.org/10.1007/3-540-09519-5_73openalex-snapshot
Probabilistic algorithms for sparse polynomials
inferredcites →https://doi.org/10.1007/978-3-319-05446-9_7openalex-snapshot
Progress on Polynomial Identity Testing-II
inferredcites →https://doi.org/10.1007/978-3-540-70575-8_6openalex-snapshot
Diagonal Circuit Identity Testing and Lower Bounds
inferredcites →https://doi.org/10.1007/978-3-540-77120-3_69openalex-snapshot
The Monomial Ideal Membership Problem and Polynomial Identity Testing
inferredcites →https://doi.org/10.1007/978-3-642-03685-9_52openalex-snapshot
Improved Polynomial Identity Testing for Read-Once Formulas
inferredcites →https://doi.org/10.1007/bf01438278openalex-snapshot
The complexity of sparse polynomial interpolation over finite fields
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-005-0188-8openalex-snapshot
Deterministic polynomial identity testing in non-commutative models
inferredcites →https://doi.org/10.1007/s00037-007-0226-9openalex-snapshot
Polynomial Identity Testing for Depth 3 Circuits
inferredcites →https://doi.org/10.1007/s00493-008-2259-3openalex-snapshot
Deterministic extractors for affine sources over large fields
inferredcites →https://doi.org/10.1016/0020-0190(78)90067-4openalex-snapshot
A probabilistic remark on algebraic program testing
inferredcites →https://doi.org/10.1016/0304-3975(91)90157-wopenalex-snapshot
On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields
inferredcites →https://doi.org/10.1016/0304-3975(95)00162-xopenalex-snapshot
On some approximation problems concerning sparse polynomials over finite fields
inferredcites →https://doi.org/10.1016/j.ic.2009.06.003openalex-snapshot
The ideal membership problem and polynomial identity testing
inferredcites →https://doi.org/10.1109/ccc.2009.18openalex-snapshot
Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in
inferredcites →https://doi.org/10.1109/ccc.2009.20openalex-snapshot
An Almost Optimal Rank Bound for Depth-3 Identities
inferredcites →https://doi.org/10.1109/focs.2008.32openalex-snapshot
Arithmetic Circuits: A Chasm at Depth Four
inferredcites →https://doi.org/10.1109/focs.2009.67openalex-snapshot
Blackbox Polynomial Identity Testing for Depth 3 Circuits
inferredcites →https://doi.org/10.1109/focs.2010.9openalex-snapshot
From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits
inferredcites →https://doi.org/10.1109/sfcs.2005.31openalex-snapshot
Deterministic Extractors for Affine Sources over Large Fields
inferredcites →https://doi.org/10.1109/sffcs.1999.814592openalex-snapshot
Primality and identity testing via Chinese remaindering
inferredcites →https://doi.org/10.1137/0219073openalex-snapshot
Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
inferredcites →https://doi.org/10.1137/05063605xopenalex-snapshot
Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
inferredcites →https://doi.org/10.1137/090770679openalex-snapshot
An Almost Optimal Rank Bound for Depth-3 Identities
inferredcites →https://doi.org/10.1145/1060590.1060678openalex-snapshot
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
inferredcites →https://doi.org/10.1145/12130.12166openalex-snapshot
Finding irreducible polynomials over finite fields
inferredcites →https://doi.org/10.1145/168304.168307openalex-snapshot
Learning sparse multivariate polynomials over a field with queries and counterexamples
inferredcites →https://doi.org/10.1145/1806689.1806779openalex-snapshot
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
inferredcites →https://doi.org/10.1145/1806689.1806780openalex-snapshot
Tensor-rank and lower bounds for arithmetic formulas
inferredcites →https://doi.org/10.1145/258533.258583openalex-snapshot
Reducing randomness via irrational numbers
inferredcites →https://doi.org/10.1145/276698.276856openalex-snapshot
Checking polynomial identities over any field
inferredcites →https://doi.org/10.1145/322217.322225openalex-snapshot
Fast Probabilistic Algorithms for Verification of Polynomial Identities
inferredcites →https://doi.org/10.1145/380752.380801openalex-snapshot
Randomness efficient identity testing of multivariate polynomials
inferredcites →https://doi.org/10.1145/780542.780595openalex-snapshot
Derandomizing polynomial identity tests means proving circuit lower bounds
inferredcites →https://doi.org/10.1145/792538.792540openalex-snapshot
Primality and identity testing via Chinese remaindering
inferredcites →https://doi.org/10.1145/800141.804674openalex-snapshot
Testing polynomials which are easy to compute (Extended Abstract)
inferredcites →https://doi.org/10.1561/0400000039openalex-snapshot
Arithmetic Circuits: A Survey of Recent Results and Open Questions
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_7openalex-snapshot
Progress on Polynomial Identity Testing-II
inferred← citeshttps://doi.org/10.1007/978-3-319-34171-2_22openalex-snapshot
Depth-4 Identity Testing and Noether’s Normalization Lemma
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-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-016-0141-zopenalex-snapshot
Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs
inferred← citeshttps://doi.org/10.1007/s00037-022-00230-9openalex-snapshot
Improved Hitting Set for Orbit of ROABPs
inferred← citeshttps://doi.org/10.1007/s00037-024-00256-1openalex-snapshot
Variety Evasive Subspace Families
inferred← citeshttps://doi.org/10.1017/fms.2022.100openalex-snapshot
A generalized Sylvester–Gallai-type theorem for quadratic polynomials
inferred← citeshttps://doi.org/10.1073/pnas.1901272116openalex-snapshot
Bootstrapping variables in algebraic circuits
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.2015.35openalex-snapshot
Deterministic Divisibility Testing via Shifted Partial Derivatives
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00018openalex-snapshot
Demystifying the border of depth-3 algebraic circuits
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00083openalex-snapshot
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
inferred← citeshttps://doi.org/10.1137/140975103openalex-snapshot
Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits
inferred← citeshttps://doi.org/10.1137/24m1662084openalex-snapshot
Linear Independence, Alternants and Applications
inferred← citeshttps://doi.org/10.1145/2554797.2554828openalex-snapshot
Testers and their applications
inferred← citeshttps://doi.org/10.1145/3170709openalex-snapshot
Identity Testing and Lower Bounds for Read- k Oblivious Algebraic Branching Programs
inferred← citeshttps://doi.org/10.1145/3313276.3316341openalex-snapshot
Sylvester-Gallai type theorems for quadratic polynomials
inferred← citeshttps://doi.org/10.1145/3406325.3451013openalex-snapshot
Polynomial time deterministic identity testing algorithm for Σ [3] ΠΣΠ [2] circuits via Edelstein–Kelly type theorem for quadratic polynomials
inferred← citeshttps://doi.org/10.1145/3519935.3520025openalex-snapshot
Ideals, determinants, and straightening: proving and using lower bounds for polynomial ideals
inferred← citeshttps://doi.org/10.1145/3564246.3585149openalex-snapshot
Linear Independence, Alternants, and Applications
inferred← citeshttps://doi.org/10.1145/3611094openalex-snapshot
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
inferred← citeshttps://doi.org/10.1145/3665800openalex-snapshot
Hitting Sets for Orbits of Circuit Classes and Polynomial Families
inferred← citeshttps://doi.org/10.4230/lipics.approx/random.2021.30openalex-snapshot
Hitting Sets and Reconstruction for Dense Orbits in VP_{e} and ΣΠΣ Circuits
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.2021.20openalex-snapshot
Variety Evasive Subspace Families
inferred← citeshttps://doi.org/10.48550/arxiv.1312.1826openalex-snapshot
Hitting-sets for low-distance multilinear depth-3
inferred← citeshttps://doi.org/10.48550/arxiv.2105.01751openalex-snapshot
Reconstruction Algorithms for Low-Rank Tensors and Depth-3 Multilinear Circuits
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.