On the public citation graph
Boolean circuit complexity of algebraic interpolation problems
0 signed · 25 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-18170-9_185openalex-snapshot
The complexity of symmetric boolean functions
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/s0019-9958(85)80041-3openalex-snapshot
A taxonomy of problems with fast parallel algorithms
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0276200-xopenalex-snapshot
Factoring polynomials over large finite fields
inferredcites →https://doi.org/10.1109/sfcs.1981.37openalex-snapshot
Probabilistic algorithms in finite fields
inferredcites →https://doi.org/10.1109/sfcs.1983.15openalex-snapshot
Factoring sparse multivariate polynomials
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.1109/sfcs.1988.21946openalex-snapshot
Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
inferredcites →https://doi.org/10.1137/0213050openalex-snapshot
Parallel Algorithms for Algebraic Problems
inferredcites →https://doi.org/10.1137/0219073openalex-snapshot
Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
inferredcites →https://doi.org/10.1145/12130.12166openalex-snapshot
Finding irreducible polynomials over finite fields
inferredcites →https://doi.org/10.1145/22145.22160openalex-snapshot
Computing with polynomials given by straight-line programs I: greatest common divisors
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/3-540-54458-5_48openalex-snapshot
Approximation algorithms for counting problems in finite fields
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_79openalex-snapshot
Randomized interpolation and approximation of sparse polynomials stPreliminary version
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_41openalex-snapshot
Efficiently Testing Sparse GF(2) Polynomials
inferred← citeshttps://doi.org/10.1007/bf01438278openalex-snapshot
The complexity of sparse polynomial interpolation over finite fields
inferred← citeshttps://doi.org/10.1007/s00453-010-9426-9openalex-snapshot
Efficiently Testing Sparse GF(2) Polynomials
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.1137/s0097539791194069openalex-snapshot
Computational Complexity of Sparse Rational Interpolation
inferred← citeshttps://doi.org/10.1145/120694.120696openalex-snapshot
Algorithms for sparse rational interpolation
inferred← citeshttps://doi.org/10.1145/143242.143287openalex-snapshot
Existence of short proofs for nondivisibility of sparse polynomials under the extended Riemann hypothesis
inferred← citeshttps://doi.org/10.48550/arxiv.0805.1765openalex-snapshot
Efficiently Testing Sparse GF(2) Polynomials
inferred← citeshttps://doi.org/10.5860/choice.33-3959openalex-snapshot
Limits to parallel computation: P-completeness theory
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.