On the public citation graph
Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae
0 signed · 51 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/3-540-09519-5_73openalex-snapshot
Probabilistic algorithms for sparse polynomials
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-642-03685-9_43openalex-snapshot
Pseudorandom Generators and Typically-Correct Derandomization
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/s00037-004-0182-6openalex-snapshot
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
inferredcites →https://doi.org/10.1007/s00037-015-0105-8openalex-snapshot
Read-once polynomial identity testing
inferredcites →https://doi.org/10.1007/s00493-016-3460-4openalex-snapshot
Black-Box Identity Testing of Depth-4 Multilinear Circuits
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/j.ic.2009.06.003openalex-snapshot
The ideal membership problem and polynomial identity testing
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.1109/ccc.2003.1214434openalex-snapshot
On derandomizing tests for certain polynomial identities
inferredcites →https://doi.org/10.1109/ccc.2008.15openalex-snapshot
Black Box Polynomial Identity Testing 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.2010.9openalex-snapshot
From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits
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.1145/1806689.1806779openalex-snapshot
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
inferredcites →https://doi.org/10.1145/1993636.1993694openalex-snapshot
Blackbox identity testing for bounded top fanin depth-3 circuits
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/62212.62241openalex-snapshot
A deterministic algorithm for sparse multivariate polynomial interpolation
inferredcites →https://doi.org/10.1145/792538.792540openalex-snapshot
Primality and identity testing via Chinese remaindering
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-79416-3_9openalex-snapshot
Limitations of Sums of Bounded Read Formulas and ABPs
inferred← citeshttps://doi.org/10.1007/978-3-319-08783-2_1openalex-snapshot
Building above Read-once Polynomials: Identity Testing and Hardness of Representation
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-22012-8_10openalex-snapshot
Algebraic Independence and Blackbox Identity Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_57openalex-snapshot
Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-40935-6_4openalex-snapshot
Exact Learning from Membership Queries: Some Techniques, Results and New Directions
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/s00224-012-9442-zopenalex-snapshot
On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation
inferred← citeshttps://doi.org/10.1007/s00453-015-0101-zopenalex-snapshot
Building Above Read-Once Polynomials: Identity Testing and Hardness of Representation
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.1016/j.tcs.2014.01.005openalex-snapshot
Monomials, multilinearity and identity testing in simple read-restricted circuits
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.034openalex-snapshot
Exact learning from an honest teacher that answers membership queries
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.1145/1993636.1993694openalex-snapshot
Blackbox identity testing for bounded top fanin depth-3 circuits
inferred← citeshttps://doi.org/10.1145/2488608.2488649openalex-snapshot
Quasi-polynomial hitting-set for set-depth-Δ formulas
inferred← citeshttps://doi.org/10.1145/2528403openalex-snapshot
From sylvester-gallai configurations to rank bounds
inferred← citeshttps://doi.org/10.1145/2554797.2554828openalex-snapshot
Testers and their applications
inferred← citeshttps://doi.org/10.1145/2858783openalex-snapshot
Characterizing Arithmetic Read-Once Formulae
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.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.30openalex-snapshot
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2016.32openalex-snapshot
Proof Complexity Lower Bounds from Algebraic Circuit Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.2010.01385openalex-snapshot
Limitations of Sums of Bounded-Read Formulas
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.