The following pages link to (Q4505382):
Displaying 6 items.
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) (Q1887713) (← links)
- The hardest halfspace (Q1983325) (← links)
- On PAC learning algorithms for rich Boolean function classes (Q2382283) (← links)
- Solving linear constraints over real and rational fields (Q2452760) (← links)
- Algorithmic Polynomials (Q5138783) (← links)
- Exact learning of DNF formulas using DNF hypotheses (Q5916223) (← links)
