scientific article; zbMATH DE number 4060753

MaRDI QIDQ3795256zbMATH OpenFDO

Authors Gyora M. Benedek, Alon Itai

Publication date 1988

zbMATH Keywords

Boolean formulacomplexityconcept classeslearnabilitynonuniform learningrecursive sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Nonuniform learnability
• scientific article; zbMATH DE number 4060740
• scientific article; zbMATH DE number 67636
• Learning in parallel
• Learning Monotone Boolean Functions by Uniformly Distributed Examples

Cited in

(15)

• Equivalence of models for polynomial learnability
• Learning in parallel
• Nonuniform learnability
• Non-systematic search and no-good learning
• PAC learning under helpful distributions
• On universal learning algorithms
• scientific article; zbMATH DE number 4060740 (Why is no real title available?)
• Learning Simple Concepts under Simple Distributions
• scientific article; zbMATH DE number 67626 (Why is no real title available?)
• scientific article; zbMATH DE number 67636 (Why is no real title available?)
• scientific article; zbMATH DE number 522871 (Why is no real title available?)
• scientific article; zbMATH DE number 7357537 (Why is no real title available?)
• VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states
• Results on learnability and the Vapnik-Chervonenkis dimension
• Learnability with respect to fixed distributions

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 Q3795256)