Exact learning of DNF formulas using DNF hypotheses (Q5916223): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complexity theoretic hardness results for query learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Queries and concept learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: When won't membership queries help? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly learning DNF and characterizing statistical query learning using Fourier analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast learning of \(k\)-term DNF formulas with queries. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact learning Boolean functions via the monotone theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subexponential exact learning algorithm for DNF using equivalence queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple learning algorithms using divide and conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/153244304322972676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asking questions to minimize errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of prime implicants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equational characterizations of Boolean function classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized constraints and certificates / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many queries are needed to learn? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact learning of DNF formulas using DNF hypotheses / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient membership-query algorithm for learning DNF with respect to the uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithm for learning O(log n)-term DNF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant depth circuits, Fourier transform, and learnability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds to Complexities of Networks for Sorting and for Switching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On limited nondeterminism and the complexity of the V-C dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the limits of proper learnability of subclasses of DNF formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Galois theory for minors of finite functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4505382 / rank
 
Normal rank

Latest revision as of 12:31, 10 June 2024

scientific article; zbMATH DE number 2175387
Language Label Description Also known as
English
Exact learning of DNF formulas using DNF hypotheses
scientific article; zbMATH DE number 2175387

    Statements

    Exact learning of DNF formulas using DNF hypotheses (English)
    0 references
    0 references
    0 references
    13 June 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Computational learning theory
    0 references
    Disjunctive normal form
    0 references
    DNF
    0 references
    Boolean functions
    0 references
    Certificates
    0 references
    Algorithms
    0 references
    Complexity theory
    0 references
    0 references
    0 references
    0 references
    0 references