On learning monotone Boolean functions under the uniform distribution
From MaRDI portal
Publication:817825
DOI10.1016/J.TCS.2005.10.012zbMATH Open1086.68061OpenAlexW2176189934MaRDI QIDQ817825FDOQ817825
Authors: Kazuyuki Amano, A. Maruoka
Publication date: 20 March 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.10.012
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Computational learning theory (68Q32) Nonnumerical algorithms (68W05) Boolean functions (06E30)
Cites Work
Cited In (11)
- Approximating the influence of monotone Boolean functions in \(O(\sqrt{n})\) query complexity
- Title not available (Why is that?)
- Aspects of complexity of probabilistic learning under monotonicity constraints
- Approximating the influence of monotone Boolean functions in \(O(\sqrt{n})\) query complexity
- Learning of monotone functions with single error correction
- KKL, Kruskal-Katona, and monotone nets
- Learning k-Term Monotone Boolean Formulae.
- Lower bound on the correlation between monotone families in the average case
- Learning Monotone Decision Trees in Polynomial Time
- Title not available (Why is that?)
- Exact learning Boolean functions via the monotone theory
This page was built for publication: On learning monotone Boolean functions under the uniform distribution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817825)