On the public citation graph
A framework for polynomial-time query learnability
0 signed · 39 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-51734-0_53openalex-snapshot
Towards representation independence in PAC learning
inferredcites →https://doi.org/10.1007/bf01578844openalex-snapshot
Structural analysis of polynomial-time query learnability
inferredcites →https://doi.org/10.1007/bfb0032028openalex-snapshot
A formal study of learning via queries
inferredcites →https://doi.org/10.1016/0022-0000(80)90041-0openalex-snapshot
Finding patterns common to a set of strings
inferredcites →https://doi.org/10.1016/0022-0000(90)90028-jopenalex-snapshot
Prediction-preserving reducibility
inferredcites →https://doi.org/10.1016/0304-3975(90)90017-copenalex-snapshot
Learning context-free grammars from structural data in polynomial time
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/0890-5401(87)90052-6openalex-snapshot
Learning regular sets from queries and counterexamples
inferredcites →https://doi.org/10.1016/b978-0-08-094829-4.50014-3openalex-snapshot
LEARNING SIMPLE DETERMINISTIC LANGUAGES
inferredcites →https://doi.org/10.1016/s0019-9958(67)91165-5openalex-snapshot
Language identification in the limit
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1145/103418.103420openalex-snapshot
When won't membership queries help?
inferredcites →https://doi.org/10.1145/356914.356918openalex-snapshot
Inductive Inference: Theory and Methods
inferredcites →https://doi.org/10.1145/48014.63140openalex-snapshot
Computational limitations on learning from examples
inferredcites →https://doi.org/10.1145/76359.76371openalex-snapshot
Learnability and the Vapnik-Chervonenkis dimension
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1995.1037openalex-snapshot
Bounding the Complexity of Advice Functions
inferred← citeshttps://doi.org/10.1006/jcss.2001.1794openalex-snapshot
A New Abstract Combinatorial Dimension for Exact Learning via Queries
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-49730-7_30openalex-snapshot
Consistent Polynomial Identification in the Limit
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_8openalex-snapshot
On the complexity of small description and related topics
inferred← citeshttps://doi.org/10.1007/3-540-57369-0_27openalex-snapshot
A note on the query complexity of learning DFA
inferred← citeshttps://doi.org/10.1007/3-540-59119-2_172openalex-snapshot
Learnability of Kolmogorov-easy circuit expressions via queries
inferred← citeshttps://doi.org/10.1007/3-540-59119-2_195openalex-snapshot
The query complexity of learning some subclasses of context-free grammars
inferred← citeshttps://doi.org/10.1007/3-540-60454-5_43openalex-snapshot
The complexity of learning minor closed graph classes
inferred← citeshttps://doi.org/10.1007/978-1-4613-3394-4_2openalex-snapshot
Algorithms for Learning Finite Automata from Queries: A Unified View
inferred← citeshttps://doi.org/10.1007/978-1-4613-3394-4_3openalex-snapshot
Coding Complexity: The Computational Complexity of Succinct Descriptions
inferred← citeshttps://doi.org/10.1007/bf01578844openalex-snapshot
Structural analysis of polynomial-time query learnability
inferred← citeshttps://doi.org/10.1007/bf03037351openalex-snapshot
The query complexity of learning DFA
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.tcs.2005.10.016openalex-snapshot
The complexity of learning concept classes with polynomial general dimension
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00161-1openalex-snapshot
PACS, simple-PAC and query learning
inferred← citeshttps://doi.org/10.1109/sct.1994.315791openalex-snapshot
The complexity of learning with queries
inferred← citeshttps://doi.org/10.1145/180139.181110openalex-snapshot
An optimal parallel algorithm for learning DFA
inferred← citeshttps://doi.org/10.48550/arxiv.1901.01910openalex-snapshot
Model Learning: A Survey on Foundation, Tools and Applications
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.