Pages that link to "Item:Q5901048"
From MaRDI portal
The following pages link to Exact learning of DNF formulas using DNF hypotheses (Q5901048):
Displaying 5 items.
- The DNF exception problem (Q818117) (← links)
- The complexity of properly learning simple concept classes (Q2462500) (← links)
- Polynomial certificates for propositional classes (Q2495655) (← links)
- Exact learning of DNF formulas using DNF hypotheses (Q5916223) (← links)
- Hardness of approximate two-level logic minimization and PAC learning with membership queries (Q5920702) (← links)
