On the public citation graph

When Won′t Membership Queries Help?

0 signed · 97 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 points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118346136.ch17openalex-snapshot
Learnability
inferred← citeshttps://doi.org/10.1006/jcss.1998.1618openalex-snapshot
Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions
inferred← citeshttps://doi.org/10.1007/11538462_29openalex-snapshot
On Learning Random DNF Formulas Under the Uniform Distribution
inferred← citeshttps://doi.org/10.1007/11549345_33openalex-snapshot
Goals in the Propositional Horn ⊃ Language Are Monotone Boolean Circuits
inferred← citeshttps://doi.org/10.1007/11872436_7openalex-snapshot
Incremental Learning of Context Free Grammars by Bridging Rule Generation and Search for Semi-optimum Rule Sets
inferred← citeshttps://doi.org/10.1007/3-540-36169-3_14openalex-snapshot
The Complexity of Learning Concept Classes with Polynomial General Dimension
inferred← citeshttps://doi.org/10.1007/3-540-44669-9_18openalex-snapshot
Prediction-Preserving Reducibility with Membership Queries on Formal Languages
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_25openalex-snapshot
Learning Expressions over Monoids
inferred← citeshttps://doi.org/10.1007/3-540-46769-6_25openalex-snapshot
Boolean Formulas Are Hard to Learn for Most Gate Bases
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_86openalex-snapshot
Separating Quantum and Classical Learning
inferred← citeshttps://doi.org/10.1007/3-540-49097-3_10openalex-snapshot
Learning Range Restricted Horn Expressions
inferred← citeshttps://doi.org/10.1007/3-540-49097-3_6openalex-snapshot
Learnability of Quantified Formulas
inferred← citeshttps://doi.org/10.1007/3-540-62685-9_13openalex-snapshot
On learning branching programs and small depth circuits
inferred← citeshttps://doi.org/10.1007/3-540-63577-7_36openalex-snapshot
On exploiting knowledge and concept use in learning theory
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_193openalex-snapshot
Learning with the Aid of an Oracle
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_96openalex-snapshot
Cryptographic Hardness of Learning
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_193openalex-snapshot
Learning with the Aid of an Oracle
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_96openalex-snapshot
Cryptographic Hardness of Learning
inferred← citeshttps://doi.org/10.1007/978-3-030-81688-9_12openalex-snapshot
Learning Union of Integer Hypercubes with Queries
inferred← citeshttps://doi.org/10.1007/978-3-031-21595-7_6openalex-snapshot
Fuzzing-Based Grammar Inference
inferred← citeshttps://doi.org/10.1007/978-3-032-10759-6_20openalex-snapshot
Insights into Learning Broadcast Protocols
inferred← citeshttps://doi.org/10.1007/978-3-032-31348-5_2openalex-snapshot
Learning Omega-Regular Languages: A Tour of Learning Results and Canonical Representations
inferred← citeshttps://doi.org/10.1007/978-3-319-10882-7_15openalex-snapshot
Learning Cover Context-Free Grammars from Structural Data
inferred← citeshttps://doi.org/10.1007/978-3-319-94667-2_24openalex-snapshot
Cryptographic Limitations on Polynomial-Time a Posteriori Query Learning
inferred← citeshttps://doi.org/10.1007/978-3-540-30215-5_28openalex-snapshot
Learnability of Relatively Quantified Generalized Formulas
inferred← citeshttps://doi.org/10.1007/978-3-540-39886-8_27openalex-snapshot
Grammatical Inference and Learning
inferred← citeshttps://doi.org/10.1007/978-3-540-72927-3_6openalex-snapshot
Learning Large-Alphabet and Analog Circuits with Value Injection Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-87987-9_24openalex-snapshot
Optimally Learning Social Networks with Activations and Suppressions
inferred← citeshttps://doi.org/10.1007/978-3-642-04414-4_16openalex-snapshot
Canonical Horn Representations and Query Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-13089-2_2openalex-snapshot
Three Learnable Models for the Description of Language
inferred← citeshttps://doi.org/10.1007/978-3-642-16108-7_2openalex-snapshot
Towards General Algorithms for Grammatical Inference
inferred← citeshttps://doi.org/10.1007/978-3-642-20169-1_12openalex-snapshot
A Learnable Representation for Syntax Using Residuated Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_193-2openalex-snapshot
Learning with the Aid of an Oracle (1996; Bshouty, Cleve, Gavaldà, Kannan, Tamon)
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_96-2openalex-snapshot
Cryptographic Hardness of Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-32024-8_13openalex-snapshot
Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher
inferred← citeshttps://doi.org/10.1007/978-3-662-48395-4_6openalex-snapshot
Distributional Learning of Context-Free and Multiple Context-Free Grammars
inferred← citeshttps://doi.org/10.1007/978-3-7908-1803-1_5openalex-snapshot
Active Learning in Neural Networks
inferred← citeshttps://doi.org/10.1007/bf00114009openalex-snapshot
Classic learning
inferred← citeshttps://doi.org/10.1007/s10994-008-5048-8openalex-snapshot
Learning large-alphabet and analog circuits with value injection queries
inferred← citeshttps://doi.org/10.1007/s10994-011-5248-5openalex-snapshot
Construction and learnability of canonical Horn formulas
inferred← citeshttps://doi.org/10.1007/s11704-019-9212-zopenalex-snapshot
Model learning: a survey of foundations, tools and applications
inferred← citeshttps://doi.org/10.1016/j.artint.2004.01.002openalex-snapshot
Theory revision with queries: Horn, read-once, and parity formulas
inferred← citeshttps://doi.org/10.1016/j.ic.2005.09.003openalex-snapshot
Learning expressions and programs over monoids
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104771openalex-snapshot
New cryptographic hardness for learning intersections of halfspaces over boolean cubes with membership queries
inferred← citeshttps://doi.org/10.1016/j.ijar.2023.109026openalex-snapshot
Learning Horn envelopes via queries from language models
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106133openalex-snapshot
Weighted automata are compact and actively learnable
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.2008.07.004openalex-snapshot
Learning a circuit by injecting values
inferred← citeshttps://doi.org/10.1016/j.jcss.2008.07.007openalex-snapshot
Hardness of approximate two-level logic minimization and PAC learning with membership queries
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.07.004openalex-snapshot
Proper learning of k-term DNF formulas from satisfying assignments
inferred← citeshttps://doi.org/10.1016/j.patcog.2005.01.004openalex-snapshot
Incremental learning of context free grammars based on bottom-up parsing and search
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.016openalex-snapshot
The complexity of learning concept classes with polynomial general dimension
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.04.008openalex-snapshot
Optimally learning social networks with activations and suppressions
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.12.019openalex-snapshot
Learning definite Horn formulas from closure queries
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00417-6openalex-snapshot
Learning elementary formal systems with queries
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00342-6openalex-snapshot
Learnability of quantified formulas
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00267-4openalex-snapshot
Query learning of bounded-width OBDDs
inferred← citeshttps://doi.org/10.1023/a:1007353007695openalex-snapshot
Characteristic Sets for Polynomial Grammatical Inference
inferred← citeshttps://doi.org/10.1023/a:1007421315813openalex-snapshot
Learning from Examples and Membership Queries with Structured Determinations
inferred← citeshttps://doi.org/10.1023/a:1007582729656openalex-snapshot
A Dichotomy Theorem for Learning Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1023/a:1026443024002openalex-snapshot
Classic Learning
inferred← citeshttps://doi.org/10.1038/nature00771openalex-snapshot
Computational and evolutionary aspects of language
inferred← citeshttps://doi.org/10.1109/ase51524.2021.9678879openalex-snapshot
Learning Highly Recursive Input Grammars
inferred← citeshttps://doi.org/10.1109/ccc.1998.694620openalex-snapshot
Resource bounded measure and learnability
inferred← citeshttps://doi.org/10.1109/ccc.2001.933881openalex-snapshot
Quantum versus classical learnability
inferred← citeshttps://doi.org/10.1109/inmic.2008.4777774openalex-snapshot
Investigating models of computational learning theory
inferred← citeshttps://doi.org/10.1109/lics.2007.50openalex-snapshot
Tractability and learnability arising from algebras with few subpowers
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646134openalex-snapshot
Number-theoretic constructions of efficient pseudo-random functions
inferred← citeshttps://doi.org/10.1111/tops.12001openalex-snapshot
Complexity in Language Acquisition
inferred← citeshttps://doi.org/10.1137/090775646openalex-snapshot
Tractability and Learnability Arising from Algebras with Few Subpowers
inferred← citeshttps://doi.org/10.1137/s0097539704412910openalex-snapshot
Equivalences and Separations Between Quantum and Classical Learnability
inferred← citeshttps://doi.org/10.1137/s0097539794274398openalex-snapshot
On Learning Read-k-Satisfy-j DNF
inferred← citeshttps://doi.org/10.1137/s009753979528812xopenalex-snapshot
Interpolating Arithmetic Read-Once Formulas in Parallel
inferred← citeshttps://doi.org/10.1137/s0097539795293123openalex-snapshot
Learning DNF over the Uniform Distribution Using a Quantum Example Oracle
inferred← citeshttps://doi.org/10.1137/s0097539797325648openalex-snapshot
Computational Sample Complexity
inferred← citeshttps://doi.org/10.1145/1132516.1132600openalex-snapshot
Learning a circuit by injecting values
inferred← citeshttps://doi.org/10.1145/168304.168311openalex-snapshot
Parameterized learning complexity
inferred← citeshttps://doi.org/10.1145/2274576.2274596openalex-snapshot
Learning schema mappings
inferred← citeshttps://doi.org/10.1145/2539032.2539035openalex-snapshot
Learning schema mappings
inferred← citeshttps://doi.org/10.1145/279943.279980openalex-snapshot
Exact learning of tree patterns from queries and counterexamples
inferred← citeshttps://doi.org/10.1145/3106700.3106710openalex-snapshot
Guest Column
inferred← citeshttps://doi.org/10.1145/3357713.3384241openalex-snapshot
Decision List Compression by Mild Random Restrictions
inferred← citeshttps://doi.org/10.1145/3368089.3409679openalex-snapshot
Mining input grammars from dynamic control flow
inferred← citeshttps://doi.org/10.1145/3369930openalex-snapshot
Exact Learning
inferred← citeshttps://doi.org/10.1145/3510455.3512787openalex-snapshot
Grammars for free
inferred← citeshttps://doi.org/10.1145/3563768.3565550openalex-snapshot
Grammar Inference for Ad Hoc Parsers
inferred← citeshttps://doi.org/10.1145/3632876openalex-snapshot
On Learning Polynomial Recursive Programs
inferred← citeshttps://doi.org/10.1145/504192.504194openalex-snapshot
SIGACT News complexity theory column 32
inferred← citeshttps://doi.org/10.1145/509907.509976openalex-snapshot
Exact learning of DNF formulas using DNF hypotheses
inferred← citeshttps://doi.org/10.1145/972639.972643openalex-snapshot
Number-theoretic constructions of efficient pseudo-random functions
inferred← citeshttps://doi.org/10.1527/tjsai.21.371openalex-snapshot
Incremental Learning of Context Free Grammars by Parsing-Based Rule Generation and Rule Set Search
inferred← citeshttps://doi.org/10.1609/aaai.v35i10.17107openalex-snapshot
Learning of Structurally Unambiguous Probabilistic Grammars
inferred← citeshttps://doi.org/10.1609/aaai.v38i11.29089openalex-snapshot
Learning Broadcast Protocols
inferred← citeshttps://doi.org/10.1613/jair.1.11798openalex-snapshot
Learning the Language of Software Errors
inferred← citeshttps://doi.org/10.4086/toc.2006.v002a008openalex-snapshot
inferred← citeshttps://doi.org/10.46298/lmcs-19(1:10)2023openalex-snapshot
Learning of Structurally Unambiguous Probabilistic Grammars
inferred← citeshttps://doi.org/10.7561/sacs.2014.2.253openalex-snapshot
Learning Cover Context-Free Grammars from Structural Data
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.