On learning random DNF formulas under the uniform distribution
From MaRDI portal
Recommendations
Cited in
(23)- DNF are teachable in the average case
- On learning monotone DNF formulae under uniform distributions
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
- An \(O(n^{\log \log n})\) learning algorithm for DNF under the uniform distribution
- On the learnability of disjunctive normal form formulas
- Learning DNF from random walks
- Exact learning from an honest teacher that answers membership queries
- Learning a Random DFA from Uniform Strings and State Information
- Learning Random Monotone DNF
- scientific article; zbMATH DE number 4092808 (Why is no real title available?)
- scientific article; zbMATH DE number 17552 (Why is no real title available?)
- Learning Boolean formulas
- Lower bounds on learning random structures with statistical queries
- Exact learning of random DNF over the uniform distribution
- DNF Are Teachable in the Average Case
- Learning from satisfying assignments
- Learnability of solutions to conjunctive queries
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Learning with maximum-entropy distributions
- Learning random monotone DNF
- Properly learning decision trees in almost polynomial time
- Approximation algorithm for DNF under distributions with limited independence
- Learning stochastic decision trees
This page was built for publication: On learning random DNF formulas under the uniform distribution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3002770)
