On the public citation graph
An Almost Optimal Rank Bound for Depth-3 Identities
0 signed · 36 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/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-540-70575-8_6openalex-snapshot
Diagonal Circuit Identity Testing and Lower Bounds
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.1109/focs.2008.32openalex-snapshot
Arithmetic Circuits: A Chasm at Depth Four
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/s0097539798341600openalex-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/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-319-05446-9_7openalex-snapshot
Progress on Polynomial Identity Testing-II
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-662-43948-7_35openalex-snapshot
Testing Equivalence of Polynomials under Shifts
inferred← citeshttps://doi.org/10.1007/s00037-015-0105-8openalex-snapshot
Read-once polynomial identity testing
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/s00224-012-9442-zopenalex-snapshot
On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation
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.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.1137/10848232openalex-snapshot
Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter
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/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/1993636.1993694openalex-snapshot
Blackbox identity testing for bounded top fanin depth-3 circuits
inferred← citeshttps://doi.org/10.1145/2528403openalex-snapshot
From sylvester-gallai configurations to rank bounds
inferred← citeshttps://doi.org/10.1145/3196836openalex-snapshot
Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas
inferred← citeshttps://doi.org/10.1145/3406325.3451096openalex-snapshot
Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits
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.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.