On the public citation graph

The complexity of sparse polynomial interpolation over finite fields

0 signed · 31 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/3-540-09519-5_73openalex-snapshot
Probabilistic algorithms for sparse polynomials
inferredcites →https://doi.org/10.1007/bfb0026299openalex-snapshot
Boolean circuit complexity of algebraic interpolation problems
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/s0747-7171(08)80018-1openalex-snapshot
Interpolating polynomials from their values
inferredcites →https://doi.org/10.1017/cbo9781139172769openalex-snapshot
Introduction to Finite Fields and their Applications
inferredcites →https://doi.org/10.1109/sfcs.1987.56openalex-snapshot
The matching problem for bipartite graphs with polynomially bounded permanents is in NC
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/0220019openalex-snapshot
Interpolation and Approximation of Sparse Multivariate Polynomials over $GF(2)$
inferredcites →https://doi.org/10.1137/0222046openalex-snapshot
Applying Coding Theory to Sparse Interpolation
inferredcites →https://doi.org/10.1145/62212.62241openalex-snapshot
A deterministic algorithm for sparse multivariate polynomial interpolation

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-03810-6_25openalex-snapshot
Exploring Crypto Dark Matter:
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/bfb0015425openalex-snapshot
Orders of Gauss periods in finite fields
inferred← citeshttps://doi.org/10.1007/s00200-005-0180-1openalex-snapshot
Noisy interpolation of sparse polynomials in finite fields
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/0304-3975(95)00162-xopenalex-snapshot
On some approximation problems concerning sparse polynomials over finite fields
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.09.029openalex-snapshot
Deterministically testing sparse polynomial identities of unbounded degree
inferred← citeshttps://doi.org/10.1016/j.jco.2024.101922openalex-snapshot
Fast interpolation of multivariate polynomials with sparse exponents
inferred← citeshttps://doi.org/10.1016/j.jsc.2012.06.004openalex-snapshot
On the bit-complexity of sparse polynomial and series multiplication
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.1016/s0304-3975(99)00133-4openalex-snapshot
Zero testing of p-adic and modular 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.2011.38openalex-snapshot
Noisy Interpolation of Sparse Polynomials, and Applications
inferred← citeshttps://doi.org/10.1109/tc.2002.1032628openalex-snapshot
A deterministic multivariate interpolation algorithm for small finite fields
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.1145/1005285.1005310openalex-snapshot
On reducing a system of equations to a single equation
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/2554797.2554828openalex-snapshot
Testers and their applications
inferred← citeshttps://doi.org/10.1145/2608628.2608648openalex-snapshot
A new deterministic algorithm for sparse multivariate polynomial interpolation
inferred← citeshttps://doi.org/10.1145/380752.380801openalex-snapshot
Randomness efficient identity testing of multivariate polynomials
inferred← citeshttps://doi.org/10.1145/380752.380803openalex-snapshot
Sparse polynomial approximation in finite fields
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.