Pages that link to "Item:Q1847366"
From MaRDI portal
The following pages link to A subexponential exact learning algorithm for DNF using equivalence queries (Q1847366):
Displaying 10 items.
- On the limits of proper learnability of subclasses of DNF formulas (Q676245) (← links)
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) (Q1887713) (← links)
- On PAC learning algorithms for rich Boolean function classes (Q2382283) (← links)
- Solving linear constraints over real and rational fields (Q2452760) (← links)
- The complexity of properly learning simple concept classes (Q2462500) (← links)
- (Q3174124) (← links)
- Learning Theory (Q5473638) (← links)
- Learning Pseudo-Boolean <i>k</i>-DNF and Submodular Functions (Q5741807) (← links)
- Hardness Characterisations and Size-width Lower Bounds for QBF Resolution (Q5886517) (← links)
- Exact learning of DNF formulas using DNF hypotheses (Q5916223) (← links)
