Learning Boolean formulas
From MaRDI portal
Publication:4327633
DOI10.1145/195613.195656zbMath0830.68108OpenAlexW2100654536MaRDI QIDQ4327633
Michael Kearns, Leslie G. Valiant, Ming Li
Publication date: 10 April 1995
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/195613.195656
Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10)
Related Items
On learning monotone DNF under product distributions, PACS, simple-PAC and query learning, Partial Occam's Razor and its applications, Learning random monotone DNF, On derandomization and average-case complexity of monotone functions, A complete characterization of statistical query learning with applications to evolvability, An evolutionary algorithm for constructing a decision forest: Combining the classification of disjoints decision trees, Genetic algorithm-based feature set partitioning for classification problems, Testing problems with sublearning sample complexity, Fuzzy lattice reasoning (FLR) classifier and its application for ambient ozone estimation, Learning with restricted focus of attention, Proper learning of \(k\)-term DNF formulas from satisfying assignments, Explaining AI decisions using efficient methods for learning sparse Boolean formulae, On the complexity of learning for spiking neurons with temporal coding., A geometric approach to leveraging weak learners, On learning monotone Boolean functions under the uniform distribution
