Pages that link to "Item:Q1892226"

The following pages link to When won't membership queries help? (Q1892226):

Displaying 39 items.

• On learning width two branching programs (Q293246) (← links)
• Construction and learnability of canonical Horn formulas (Q415621) (← links)
• Active learning of nondeterministic finite state machines (Q459826) (← links)
• Learning definite Horn formulas from closure queries (Q507524) (← links)
• Classic learning (Q676240) (← links)
• On the limits of proper learnability of subclasses of DNF formulas (Q676245) (← links)
• Theory revision with queries: Horn, read-once, and parity formulas (Q814598) (← links)
• The complexity of learning concept classes with polynomial general dimension (Q817832) (← links)
• Learning union of integer hypercubes with queries (with applications to monadic decomposition) (Q832265) (← links)
• Optimally learning social networks with activations and suppressions (Q982645) (← links)
• Learning large-alphabet and analog circuits with value injection queries (Q1009264) (← links)
• Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
• Prefix grammars: An alternative characterization of the regular languages (Q1332773) (← links)
• The query complexity of learning DFA (Q1336037) (← links)
• An efficient membership-query algorithm for learning DNF with respect to the uniform distribution (Q1384530) (← links)
• Recent advances of grammatical inference (Q1390941) (← links)
• Learning orthogonal F-Horn formulas (Q1390949) (← links)
• Learnability of quantified formulas. (Q1426470) (← links)
• Even linear simple matrix languages: formal language properties and grammatical inference. (Q1853536) (← links)
• Learning elementary formal systems with queries. (Q1874227) (← links)
• Weighted automata are compact and actively learnable (Q2032169) (← links)
• New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795) (← links)
• Proper learning of \(k\)-term DNF formulas from satisfying assignments (Q2323349) (← links)
• Explaining AI decisions using efficient methods for learning sparse Boolean formulae (Q2331079) (← links)
• Incremental learning of context free grammars based on bottom-up parsing and search (Q2485077) (← links)
• Learning expressions and programs over monoids (Q2490112) (← links)
• Distributional Learning of Context-Free and Multiple Context-Free Grammars (Q2963597) (← links)
• Canonical Horn Representations and Query Learning (Q3648750) (← links)
• A framework for polynomial-time query learnability (Q4298370) (← links)
• Structural analysis of polynomial-time query learnability (Q4298371) (← links)
• Learning two-tape automata from queries and counterexamples (Q4879209) (← links)
• On the complexity of small description and related topics (Q5096821) (← links)
• (Q5381121) (← links)
• Learning of Structurally Unambiguous Probabilistic Grammars (Q5883734) (← links)
• Query learning of bounded-width OBDDs (Q5915394) (← links)
• Exact learning of DNF formulas using DNF hypotheses (Q5916223) (← links)
• Hardness of approximate two-level logic minimization and PAC learning with membership queries (Q5920702) (← links)
• Learning a circuit by injecting values (Q5920703) (← links)
• Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions (Q5958646) (← links)