scientific article; zbMATH DE number 67616
From MaRDI portal
Publication:4013534
zbMATH Open0747.68046MaRDI QIDQ4013534FDOQ4013534
Authors: Lisa Hellerstein, Marek Karpinski 
Publication date: 27 September 1992
Title of this publication is not available (Why is that?)
Recommendations
membership queriesexact learning of read-once formulasmembership query algorithmprojective equivalence oracle
Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms and problem complexity (68Q25)
Cited In (20)
- A fast parallel algorithm to recognize P4-sparse graphs
- Learning Boolean read-once formulas over generalized bases
- Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries
- Learning from examples with unspecified attribute values.
- Learning with queries inside the class of unate \(k\)-quasi-Horn formulas
- A new abstract combinatorial dimension for exact learning via queries
- The complexity of learning minor closed graph classes
- Learnability of exclusive-or expansion based on monotone DNF formulas
- Learning with errors in answers to membership queries
- Exact learning from an honest teacher that answers membership queries
- Exact learning of subclasses of CDNF formulas with membership queries
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs
- Read-twice DNF formulas are properly learnable
- An algorithm to learn read-once threshold formulas, and transformations between learning models
- Learning Arithmetic Read-Once Formulas
- Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
- Learning read-once formulas with queries
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs
- The complexity of learning concept classes with polynomial general dimension
- Learning read once functions using subcube parity queries
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4013534)
