Pages that link to "Item:Q1603482"
From MaRDI portal
The following pages link to Almost all monotone Boolean functions are polynomially learnable using membership queries (Q1603482):
Displaying 9 items.
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- Exact learning of linear combinations of monotone terms from function value queries (Q1367523) (← links)
- Learning of monotone functions with single error correction (Q2050228) (← links)
- An average study of hypergraphs and their minimal transversals (Q2355712) (← links)
- On algorithms for construction of all irreducible partial covers (Q2379946) (← links)
- Exact learning Boolean functions via the monotone theory (Q2506483) (← links)
- Minimizing the average query complexity of learning monotone Boolean functions (Q2884531) (← links)
- Learning k-Term Monotone Boolean Formulae. (Q4244821) (← links)
