Learning k-Term Monotone Boolean Formulae.
From MaRDI portal
Recommendations
- Exact learning Boolean functions via the monotone theory
- Learning nearly monotone k-term DNF
- A dichotomy theorem for learning quantified Boolean formulas
- On learning monotone Boolean functions with irrelevant variables
- On the learnability of monotone \(k\mu\)-DNF formulae under product distributions
- Minimizing the average query complexity of learning monotone Boolean functions
- scientific article; zbMATH DE number 1966606
- On learning monotone Boolean functions under the uniform distribution
- Almost all monotone Boolean functions are polynomially learnable using membership queries
Cited in
(10)- On the learnability of monotone \(k\mu\)-DNF formulae under product distributions
- Exact learning of linear combinations of monotone terms from function value queries
- Proper learning algorithm for functions of k terms under smooth distributions.
- On learning monotone DNF under product distributions
- Learning monotone log-term DNF formulas under the uniform distribution
- Exact learning Boolean functions via the monotone theory
- scientific article; zbMATH DE number 1804125 (Why is no real title available?)
- scientific article; zbMATH DE number 4092808 (Why is no real title available?)
- Learning Monotone Boolean Functions by Uniformly Distributed Examples
- Learning Boolean formulas
This page was built for publication: Learning k-Term Monotone Boolean Formulae.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4244821)
