The complexity of properly learning simple concept classes (Q2462500): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Resolution Is Not Automatizable Unless W[P] Is Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Occam's razor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for cutting planes proofs with small coefficients / 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: Short proofs are narrow—resolution made simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of 3-uniform hypergraph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized graph products, chromatic numbers, and Lovasz j-function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of automaton identification from given data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on learning decision lists and trees / 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: Learnability beyond AC <sup>0</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic hardness of distribution-specific learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning DNF in time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic limitations on learning Boolean formulae and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning juntas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational limitations on learning from examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank

Latest revision as of 13:47, 27 June 2024

scientific article
Language Label Description Also known as
English
The complexity of properly learning simple concept classes
scientific article

    Statements

    The complexity of properly learning simple concept classes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 November 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    proper learning
    0 references
    PAC learning
    0 references
    hardness of learning
    0 references
    DNF formulas
    0 references
    intersections of halfspaces
    0 references
    decision trees
    0 references
    automatizability
    0 references
    proof complexity
    0 references
    0 references