Pages that link to "Item:Q1964325"
From MaRDI portal
The following pages link to A dichotomy theorem for learning quantified Boolean formulas (Q1964325):
Displaying 8 items.
- Learnability of quantified formulas. (Q1426470) (← links)
- Learning intersection-closed classes with signatures (Q2381578) (← links)
- Learning k-Term Monotone Boolean Formulae. (Q4244821) (← links)
- Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation (Q5326456) (← links)
- (Q5381121) (← links)
- Algorithmic Learning Theory (Q5464509) (← links)
- Learning Disjunctions: Near-Optimal Trade-off between Mistakes and “I Don't Knows” (Q5741808) (← links)
- On the non-efficient PAC learnability of conjunctive queries (Q6072217) (← links)