On the public citation graph

https://doi.org/10.4086/toc.2006.v002a010

0 signed · 64 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.1006/jagm.1999.1045openalex-snapshot
Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with 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.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.1006/jcss.2000.1730openalex-snapshot
Pseudorandom Generators without the XOR Lemma
inferredcites →https://doi.org/10.1007/3-540-09519-5_73openalex-snapshot
Probabilistic algorithms for sparse polynomials
inferredcites →https://doi.org/10.1007/3-540-62685-9_13openalex-snapshot
On learning branching programs and small depth circuits
inferredcites →https://doi.org/10.1007/978-3-540-45167-9_34openalex-snapshot
Learning Arithmetic Circuits via Partial Derivatives
inferredcites →https://doi.org/10.1007/bf00116828openalex-snapshot
Queries and Concept Learning
inferredcites →https://doi.org/10.1007/bf01294256openalex-snapshot
Lower bounds on arithmetic circuits via partial derivatives
inferredcites →https://doi.org/10.1007/pl00001609openalex-snapshot
Depth-3 arithmetic circuits over fields of characteristic zero
inferredcites →https://doi.org/10.1007/s00037-005-0188-8openalex-snapshot
Deterministic polynomial identity testing in non-commutative models
inferredcites →https://doi.org/10.1016/s0020-0190(97)00204-4openalex-snapshot
On learning width two branching programs
inferredcites →https://doi.org/10.1016/s0022-0000(71)80005-3openalex-snapshot
Realizations by stochastic finite automata
inferredcites →https://doi.org/10.1017/cbo9780511987045openalex-snapshot
A Course in Combinatorics
inferredcites →https://doi.org/10.1109/ccc.2004.1313845openalex-snapshot
Deterministic polynomial identity testing in non commutative models
inferredcites →https://doi.org/10.1109/sfcs.1998.743456openalex-snapshot
Exponential complexity lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields
inferredcites →https://doi.org/10.1137/s0097539791194069openalex-snapshot
Computational Complexity of Sparse Rational Interpolation
inferredcites →https://doi.org/10.1137/s009753979223664xopenalex-snapshot
Learning Arithmetic Read-Once Formulas
inferredcites →https://doi.org/10.1137/s009753979326091xopenalex-snapshot
Learning Behaviors of Automata from Multiplicity and Equivalence Queries
inferredcites →https://doi.org/10.1137/s009753979732058xopenalex-snapshot
Simple Learning Algorithms for Decision Trees and Multivariate Polynomials
inferredcites →https://doi.org/10.1145/1007352.1007353openalex-snapshot
Multi-linear formulas for permanent and determinant are of super-polynomial size
inferredcites →https://doi.org/10.1145/103418.103461openalex-snapshot
The expressive power of voting polynomials
inferredcites →https://doi.org/10.1145/103418.103462openalex-snapshot
Lower bounds for non-commutative computation
inferredcites →https://doi.org/10.1145/12130.12132openalex-snapshot
Almost optimal lower bounds for small depth circuits
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/174130.174138openalex-snapshot
Constant depth circuits, Fourier transform, and learnability
inferredcites →https://doi.org/10.1145/276698.276872openalex-snapshot
An exponential lower bound for depth 3 arithmetic circuits
inferredcites →https://doi.org/10.1145/278298.278306openalex-snapshot
Proof verification and the hardness of approximation problems
inferredcites →https://doi.org/10.1145/322217.322225openalex-snapshot
Fast Probabilistic Algorithms for Verification of Polynomial Identities
inferredcites →https://doi.org/10.1145/337244.337257openalex-snapshot
Learning functions represented as multiplicity automata
inferredcites →https://doi.org/10.1145/380752.380801openalex-snapshot
Randomness efficient identity testing of multivariate polynomials
inferredcites →https://doi.org/10.1145/509907.510018openalex-snapshot
Learnability beyond AC 0
inferredcites →https://doi.org/10.1145/510014.510018openalex-snapshot
Learnability beyond AC0
inferredcites →https://doi.org/10.4086/toc.2006.v002a006openalex-snapshot

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-04414-4_19openalex-snapshot
An Algebraic Perspective on Boolean Function Learning
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_35openalex-snapshot
Complexity of Equivalence and Learning for Multiplicity Tree Automata
inferred← citeshttps://doi.org/10.1007/s00037-015-0097-4openalex-snapshot
Deterministic polynomial identity tests for multilinear bounded-read formulae
inferred← citeshttps://doi.org/10.1007/s00037-019-00189-0openalex-snapshot
Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115214openalex-snapshot
Lower bounds for the sum of small-size algebraic branching programs
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/focs.2011.70openalex-snapshot
Efficient Reconstruction of Random Multilinear Formulas
inferred← citeshttps://doi.org/10.1109/focs.2013.34openalex-snapshot
Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs
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.1137/070694879openalex-snapshot
Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates
inferred← citeshttps://doi.org/10.1137/130910725openalex-snapshot
Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits
inferred← citeshttps://doi.org/10.1137/24m1662084openalex-snapshot
Linear Independence, Alternants and Applications
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/2213977.2213995openalex-snapshot
On identity testing of tensors, low-rank recovery and compressed sensing
inferred← citeshttps://doi.org/10.1145/2213977.2214033openalex-snapshot
Jacobian hits circuits
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/2488608.2488649openalex-snapshot
Quasi-polynomial hitting-set for set-depth-Δ 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/3564246.3585149openalex-snapshot
Linear Independence, Alternants, and Applications
inferred← citeshttps://doi.org/10.1145/3726532openalex-snapshot
Reconstruction of Depth-4 Multilinear Circuits
inferred← citeshttps://doi.org/10.1145/3798129.3800875openalex-snapshot
Learning Read-Once Determinants and the Principal Minor Assignment Problem
inferred← citeshttps://doi.org/10.1145/3798129.3800878openalex-snapshot
Reconstruction of Depth-3 Arithmetic Circuits with Constant Top Fan-In
inferred← citeshttps://doi.org/10.1561/0400000039openalex-snapshot
Arithmetic Circuits: A Survey of Recent Results and Open Questions
inferred← citeshttps://doi.org/10.4086/cjtcs.2019.002openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2014.v010a018openalex-snapshot
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2015.323openalex-snapshot
Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs
inferred← citeshttps://doi.org/10.48550/arxiv.1405.0514openalex-snapshot
Complexity of Equivalence and Learning for Multiplicity Tree Automata
inferred← citeshttps://doi.org/10.48550/arxiv.1512.01256openalex-snapshot
Reconstruction of depth-3, top fan-in two circuits over characteristic zero fields
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.