On the public citation graph
Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates
0 signed · 48 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.1995.1023openalex-snapshot
Effective Noether Irreducibility Forms and Applications
inferredcites →https://doi.org/10.1006/jcss.1995.1042openalex-snapshot
Learning Boolean Read-Once Formulas over Generalized Bases
inferredcites →https://doi.org/10.1006/jcss.1995.1046openalex-snapshot
Cryptographic Lower Bounds for Learnability of Boolean Functions on the Uniform Distribution
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.1006/jcss.1997.1550openalex-snapshot
On Interpolating Arithmetic Read-Once Formulas with Exponentiation
inferredcites →https://doi.org/10.1007/pl00001609openalex-snapshot
Depth-3 arithmetic circuits over fields of characteristic zero
inferredcites →https://doi.org/10.1007/s00037-006-0216-3openalex-snapshot
Lower bounds for linear locally decodable codes and private information retrieval
inferredcites →https://doi.org/10.1007/s000370100002openalex-snapshot
Pseudorandom functions in $ \textit{TC}^{0} $ and cryptographic limitations to proving lower bounds
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/s0747-7171(08)80015-6openalex-snapshot
Computing with polynomials given byblack boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators
inferredcites →https://doi.org/10.1137/0214035openalex-snapshot
Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
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/s0097539791194069openalex-snapshot
Computational Complexity of Sparse Rational Interpolation
inferredcites →https://doi.org/10.1137/s0097539792239291openalex-snapshot
Randomized Interpolation and Approximation of Sparse Polynomials
inferredcites →https://doi.org/10.1137/s009753979528812xopenalex-snapshot
Interpolating Arithmetic Read-Once Formulas in Parallel
inferredcites →https://doi.org/10.1145/174644.174647openalex-snapshot
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
inferredcites →https://doi.org/10.1145/337244.337257openalex-snapshot
Learning functions represented as multiplicity automata
inferredcites →https://doi.org/10.1145/972639.972643openalex-snapshot
Number-theoretic constructions of efficient pseudo-random functions
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-642-03685-9_52openalex-snapshot
Improved Polynomial Identity Testing for Read-Once Formulas
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-014-0085-0openalex-snapshot
Random arithmetic formulas can be reconstructed efficiently
inferred← citeshttps://doi.org/10.1007/s00037-015-0105-8openalex-snapshot
Read-once polynomial identity testing
inferred← citeshttps://doi.org/10.1007/s00037-016-0142-yopenalex-snapshot
Sparse multivariate polynomial interpolation on the basis of Schubert polynomials
inferred← citeshttps://doi.org/10.1007/s00037-023-00239-8openalex-snapshot
Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond
inferred← citeshttps://doi.org/10.1007/s00493-011-2537-3openalex-snapshot
Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.07.005openalex-snapshot
Derandomization and absolute reconstruction for sums of powers of linear forms
inferred← citeshttps://doi.org/10.1017/fms.2022.100openalex-snapshot
A generalized Sylvester–Gallai-type theorem for quadratic polynomials
inferred← citeshttps://doi.org/10.1109/ccc.2008.15openalex-snapshot
Black Box Polynomial Identity Testing of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-In
inferred← citeshttps://doi.org/10.1109/ccc.2009.18openalex-snapshot
Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in
inferred← citeshttps://doi.org/10.1109/ccc.2013.10openalex-snapshot
Random Arithmetic Formulas Can Be Reconstructed Efficiently
inferred← citeshttps://doi.org/10.1109/focs.2010.9openalex-snapshot
From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits
inferred← citeshttps://doi.org/10.1109/focs.2011.70openalex-snapshot
Efficient Reconstruction of Random Multilinear Formulas
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.1145/2213977.2214035openalex-snapshot
Reconstruction of depth-4 multilinear circuits with top fan-in 2
inferred← citeshttps://doi.org/10.1145/2528403openalex-snapshot
From sylvester-gallai configurations to rank bounds
inferred← citeshttps://doi.org/10.1145/3313276.3316341openalex-snapshot
Sylvester-Gallai type theorems for quadratic polynomials
inferred← citeshttps://doi.org/10.1145/3726532openalex-snapshot
Reconstruction of Depth-4 Multilinear 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.approx/random.2021.30openalex-snapshot
Hitting Sets and Reconstruction for Dense Orbits in VP_{e} and ΣΠΣ Circuits
inferred← citeshttps://doi.org/10.4230/lipics.approx/random.2021.50openalex-snapshot
Hitting Sets for Orbits of Circuit Classes and Polynomial Families
inferred← citeshttps://doi.org/10.48550/arxiv.1002.0145openalex-snapshot
From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits
inferred← citeshttps://doi.org/10.48550/arxiv.2105.01751openalex-snapshot
Reconstruction Algorithms for Low-Rank Tensors and Depth-3 Multilinear Circuits
inferred← citeshttps://doi.org/10.70675/26419355z22a8z4307za695zd52afacbe6eeopenalex-snapshot
Algorithmes algébriques et numériques pour la décomposition de tenseurs symétriques
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.