Structural analysis of polynomial-time query learnability (Q4298371): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: When won't membership queries help? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3729902 / 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: Prediction-preserving reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for polynomial-time query learnability / rank
 
Normal rank

Revision as of 16:02, 22 May 2024

scientific article; zbMATH DE number 611107
Language Label Description Also known as
English
Structural analysis of polynomial-time query learnability
scientific article; zbMATH DE number 611107

    Statements

    Structural analysis of polynomial-time query learnability (English)
    0 references
    0 references
    0 references
    20 March 1995
    0 references
    polynomial-time query learning systems
    0 references

    Identifiers