Pages that link to "Item:Q960515"
From MaRDI portal
The following pages link to Fast learning of \(k\)-term DNF formulas with queries. (Q960515):
Displaying 17 items.
- Learning nearly monotone \(k\)-term DNF (Q293322) (← links)
- Constraint acquisition (Q511791) (← links)
- On the limits of proper learnability of subclasses of DNF formulas (Q676245) (← links)
- Theory revision with queries: Horn, read-once, and parity formulas (Q814598) (← links)
- Efficient multiple constraint acquisition (Q823769) (← links)
- Parameterized learnability of juntas (Q1034613) (← links)
- On using the Fourier transform to learn disjoint DNF (Q1318745) (← links)
- Simple learning algorithms using divide and conquer (Q1355381) (← links)
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution (Q1384530) (← links)
- The query complexity of finding local minima in the lattice (Q1854471) (← links)
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms (Q1861581) (← links)
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) (Q1887713) (← links)
- \(P\)-sufficient statistics for PAC learning \(k\)-term-DNF formulas through enumeration (Q1978498) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Parameterized Learnability of k-Juntas and Related Problems (Q3520054) (← 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)
