Minimizing the average query complexity of learning monotone Boolean functions
From MaRDI portal
Recommendations
- Guided inference of nested monotone Boolean functions
- On one criterion of the optihality of an algorithm for evaluating monotonic boolean functions
- Exact learning Boolean functions via the monotone theory
- scientific article; zbMATH DE number 1617283
- Almost all monotone Boolean functions are polynomially learnable using membership queries
Cited in
(12)- Exact learning of linear combinations of monotone terms from function value queries
- On the inference of semi-coherent structures from data
- Guided inference of nested monotone Boolean functions
- Resolution based algorithms for the transversal hypergraph generation problem
- Exact learning Boolean functions via the monotone theory
- How to apply SAT-solving for the equivalence test of monotone normal forms
- On one criterion of the optihality of an algorithm for evaluating monotonic boolean functions
- scientific article; zbMATH DE number 3974158 (Why is no real title available?)
- Learning k-Term Monotone Boolean Formulae.
- A fast and simple algorithm for identifying 2-monotonic positive Boolean functions
- Identification of a monotone Boolean function with \(k\) ``reasons as a combinatorial search problem
- Computational aspects of monotone dualization: a brief survey
This page was built for publication: Minimizing the average query complexity of learning monotone Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884531)
