Pages that link to "Item:Q2884531"
From MaRDI portal
The following pages link to Minimizing the average query complexity of learning monotone Boolean functions (Q2884531):
Displaying 10 items.
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- Exact learning of linear combinations of monotone terms from function value queries (Q1367523) (← links)
- On the inference of semi-coherent structures from data (Q1781558) (← links)
- Guided inference of nested monotone Boolean functions (Q1810471) (← links)
- Resolution based algorithms for the transversal hypergraph generation problem (Q2310740) (← links)
- Exact learning Boolean functions via the monotone theory (Q2506483) (← links)
- How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms (Q3007677) (← links)
- Learning k-Term Monotone Boolean Formulae. (Q4244821) (← links)
- A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions (Q4386450) (← links)
- A fast and simple algorithm for identifying 2-monotonic positive Boolean functions (Q6487975) (← links)