scientific article; zbMATH DE number 1301800
From MaRDI portal
Publication:4247017
Recommendations
Cited in
(12)- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Learning intersections and thresholds of halfspaces
- Learning random monotone DNF
- Learning DNF from random walks
- On the limits of proper learnability of subclasses of DNF formulas
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\)
- On the Fourier spectrum of symmetric Boolean functions
- Intractability and approximation of optimization theories of cognition
- Learning Random Monotone DNF
- On learning monotone DNF formulae under uniform distributions
- On using the Fourier transform to learn disjoint DNF
- Learning functions of \(k\) relevant variables
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247017)