The following pages link to Learning Boolean formulas (Q4327633):
Displaying 16 items.
- PACS, simple-PAC and query learning (Q294709) (← links)
- On derandomization and average-case complexity of monotone functions (Q428873) (← links)
- A complete characterization of statistical query learning with applications to evolvability (Q439989) (← links)
- Learning random monotone DNF (Q628302) (← links)
- On learning monotone Boolean functions under the uniform distribution (Q817825) (← links)
- Fuzzy lattice reasoning (FLR) classifier and its application for ambient ozone estimation (Q997040) (← links)
- Partial Occam's Razor and its applications (Q1127393) (← links)
- Learning with restricted focus of attention (Q1271613) (← links)
- A geometric approach to leveraging weak learners (Q1603593) (← links)
- On the complexity of learning for spiking neurons with temporal coding. (Q1854302) (← links)
- On learning monotone DNF under product distributions (Q1881232) (← links)
- Proper learning of \(k\)-term DNF formulas from satisfying assignments (Q2323349) (← links)
- Explaining AI decisions using efficient methods for learning sparse Boolean formulae (Q2331079) (← links)
- Genetic algorithm-based feature set partitioning for classification problems (Q2476578) (← links)
- An evolutionary algorithm for constructing a decision forest: Combining the classification of disjoints decision trees (Q5387323) (← links)
- Testing problems with sublearning sample complexity (Q5929914) (← links)
