Pages that link to "Item:Q2323349"
From MaRDI portal
The following pages link to Proper learning of \(k\)-term DNF formulas from satisfying assignments (Q2323349):
Displaying 13 items.
- Finding a minimal 1-DNF consistent with a positive sample is LOGSNP-complete (Q294591) (← links)
- On the limits of proper learnability of subclasses of DNF formulas (Q676245) (← links)
- DKL: an efficient algorithm for learning deterministic Kripke structures (Q824283) (← links)
- Fast learning of \(k\)-term DNF formulas with queries. (Q960515) (← links)
- A subexponential exact learning algorithm for DNF using equivalence queries (Q1847366) (← links)
- Proper learning algorithm for functions of \(k\) terms under smooth distributions. (Q1854298) (← links)
- \(P\)-sufficient statistics for PAC learning \(k\)-term-DNF formulas through enumeration (Q1978498) (← links)
- The complexity of properly learning simple concept classes (Q2462500) (← links)
- Learning to select branching rules in the DPLL procedure for satisfiability (Q2741536) (← links)
- (Q3174124) (← links)
- ILP Through Propositionalization and Stochastic k-Term DNF Learning (Q5426063) (← links)
- Learning Theory (Q5473638) (← links)
- Machine Learning: ECML 2003 (Q5897345) (← links)
