On the public citation graph

On Interpolating Arithmetic Read-Once Formulas with Exponentiation

0 signed · 32 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.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1109/fscs.1990.89616openalex-snapshot
Interpolation of sparse rational functions without knowing bounds on exponents
inferredcites →https://doi.org/10.1137/0216040openalex-snapshot
Factoring Multivariate Polynomials over Algebraic Number Fields
inferredcites →https://doi.org/10.1137/0220019openalex-snapshot
Interpolation and Approximation of Sparse Multivariate Polynomials over $GF(2)$
inferredcites →https://doi.org/10.1145/100216.100292openalex-snapshot
On the decidability of sparse univariate polynomial interpolation
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/322217.322225openalex-snapshot
Fast Probabilistic Algorithms for Verification of Polynomial Identities
inferredcites →https://doi.org/10.1145/62212.62241openalex-snapshot
A deterministic algorithm for sparse multivariate polynomial interpolation
inferredcites →https://doi.org/10.1145/800141.804674openalex-snapshot
Testing polynomials which are easy to compute (Extended Abstract)

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11776420_27openalex-snapshot
Efficient Learning Algorithms Yield Circuit Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-030-19955-5_22openalex-snapshot
On the Complexity of Restarting
inferred← citeshttps://doi.org/10.1007/978-3-319-34171-2_19openalex-snapshot
Sums of Read-Once Formulas: How Many Summands Suffice?
inferred← citeshttps://doi.org/10.1007/978-3-540-45167-9_34openalex-snapshot
Learning Arithmetic Circuits via Partial Derivatives
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-642-40935-6_4openalex-snapshot
Exact Learning from Membership Queries: Some Techniques, Results and New Directions
inferred← citeshttps://doi.org/10.1007/978-981-92-3309-0_34openalex-snapshot
On the Border Complexity of Sums of ROFs
inferred← citeshttps://doi.org/10.1007/s00037-015-0105-8openalex-snapshot
Read-once polynomial identity testing
inferred← citeshttps://doi.org/10.1016/j.jcss.2008.07.006openalex-snapshot
Efficient learning algorithms yield circuit lower bounds
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.10.019openalex-snapshot
Sums of read-once formulas: How many summands are necessary?
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/ccc.2009.18openalex-snapshot
Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in
inferred← citeshttps://doi.org/10.1137/070694879openalex-snapshot
Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates
inferred← citeshttps://doi.org/10.1145/1250790.1250833openalex-snapshot
Interpolation of depth-3 arithmetic circuits with two multiplication gates
inferred← citeshttps://doi.org/10.1145/2858783openalex-snapshot
Characterizing Arithmetic Read-Once Formulae
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/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.4086/toc.2006.v002a010openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2014.v010a018openalex-snapshot
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.48550/arxiv.1408.1995openalex-snapshot
Characterizing Arithmetic Read-Once Formulae
inferred← citeshttps://doi.org/10.48550/arxiv.1512.04386openalex-snapshot
Read-once polynomials: How many summands suffice?
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.