On the public citation graph

Simple learning algorithms using divide and conquer

https://doi.org/10.1007/bf01262930
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.
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/inco.1995.1164openalex-snapshot
Exact Learning Boolean Functions via the Monotone Theory
inferredcites →https://doi.org/10.1007/bf00116828openalex-snapshot
Queries and Concept Learning
inferredcites →https://doi.org/10.1016/b978-1-55860-146-8.50014-xopenalex-snapshot
Learning Functions of k Terms
inferredcites →https://doi.org/10.1017/cbo9780511814075openalex-snapshot
Randomized Algorithms
inferredcites →https://doi.org/10.1109/sfcs.1993.366857openalex-snapshot
Exact learning via the Monotone theory
inferredcites →https://doi.org/10.1137/0220019openalex-snapshot
Interpolation and Approximation of Sparse Multivariate Polynomials over $GF(2)$
inferredcites →https://doi.org/10.1137/0222080openalex-snapshot
Learning Decision Trees Using the Fourier Spectrum
inferredcites →https://doi.org/10.1145/129712.129748openalex-snapshot
Fast learning of k -term DNF formulas with queries
inferredcites →https://doi.org/10.1145/138027.138061openalex-snapshot
Learning read-once formulas with queries
inferredcites →https://doi.org/10.1145/167088.167200openalex-snapshot
Efficient noise-tolerant learning from statistical queries
inferredcites →https://doi.org/10.1145/168304.168310openalex-snapshot
Asking questions to minimize errors
inferredcites →https://doi.org/10.1145/174644.174647openalex-snapshot
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
inferredcites →https://doi.org/10.1145/180139.181095openalex-snapshot
Learning monotone log-term DNF formulas
inferredcites →https://doi.org/10.1145/195058.195147openalex-snapshot
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
inferredcites →https://doi.org/10.1145/1968.1972openalex-snapshot
A theory of the learnable
inferredcites →https://doi.org/10.1145/28395.28426openalex-snapshot
On the learnability of Boolean formulae
inferredcites →https://doi.org/10.1145/3749740.3749746openalex-snapshot
A Theory of the Learnable
inferredcites →https://doi.org/10.5555/92571.92620openalex-snapshot
Learning functions of k terms

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.2001.3065openalex-snapshot
The Query Complexity of Finding Local Minima in the Lattice
inferred← citeshttps://doi.org/10.1007/11894841_17openalex-snapshot
On Exact Learning from Random Walk
inferred← citeshttps://doi.org/10.1007/3-540-44581-1_37openalex-snapshot
On Learning Monotone DNF under Product Distributions
inferred← citeshttps://doi.org/10.1007/3-540-44581-1_38openalex-snapshot
Learning Regular Sets with an Incomplete Membership Oracle
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_194openalex-snapshot
Learning Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-26176-4_13openalex-snapshot
On Exactly Learning Disjunctions and DNFs Without Equivalence Queries
inferred← citeshttps://doi.org/10.1007/978-3-031-19135-0_1openalex-snapshot
SAT-Based Invariant Inference and Its Relation to Concept Learning
inferred← citeshttps://doi.org/10.1007/978-3-031-92932-8_3openalex-snapshot
On Exact Learning of d-Monotone Functions
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/978-3-540-87987-9_29openalex-snapshot
Finding the Rare Cube
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/s00453-010-9426-9openalex-snapshot
Efficiently Testing Sparse GF(2) Polynomials
inferred← citeshttps://doi.org/10.1007/s10489-014-0550-0openalex-snapshot
Learning in context: enhancing machine learning with context-based reasoning
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.01.006openalex-snapshot
On approximating weighted sums with exponentially many terms
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.10.001openalex-snapshot
Exact learning of DNF formulas using DNF hypotheses
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.04.010openalex-snapshot
Learning with errors in answers to membership queries
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.2006.27openalex-snapshot
Minimizing DNF Formulas and AC^0_d Circuits Given a Truth Table
inferred← citeshttps://doi.org/10.1109/focs.2004.37openalex-snapshot
Learning with Errors in Answers to Membership Queries (Extracted Abstract)
inferred← citeshttps://doi.org/10.1137/060664537openalex-snapshot
Minimizing Disjunctive Normal Form Formulas and $AC^0$ Circuits Given a Truth Table
inferred← citeshttps://doi.org/10.1145/225058.225125openalex-snapshot
On the Fourier spectrum of monotone functions
inferred← citeshttps://doi.org/10.1145/279943.280000openalex-snapshot
The query complexity of finding local minima in the lattice
inferred← citeshttps://doi.org/10.1145/307400.307415openalex-snapshot
On learning in the presence of unspecified attribute values
inferred← citeshttps://doi.org/10.1145/337244.337257openalex-snapshot
Learning functions represented as multiplicity automata
inferred← citeshttps://doi.org/10.1145/3434296openalex-snapshot
Learning the boundary of inductive invariants
inferred← citeshttps://doi.org/10.1145/3717823.3718262openalex-snapshot
DNF Learning via Locally Mixing Random Walks
inferred← citeshttps://doi.org/10.1145/3798129.3800766openalex-snapshot
Learning CNF Formulas from Uniform Random Solutions in the Local Lemma Regime
inferred← citeshttps://doi.org/10.1145/509907.509976openalex-snapshot
Exact learning of DNF formulas using DNF hypotheses
inferred← citeshttps://doi.org/10.48550/arxiv.0805.1765openalex-snapshot
Efficiently Testing Sparse GF(2) Polynomials
inferred← citeshttps://doi.org/10.48550/arxiv.1111.1124openalex-snapshot
Tight Bounds on Proper Equivalence Query Learning of DNF
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.