Pages that link to "Item:Q2462500"
From MaRDI portal
The following pages link to The complexity of properly learning simple concept classes (Q2462500):
Displaying 12 items.
- Special issue in memory of Misha Alekhnovich. Foreword (Q430839) (← links)
- On the hardness of learning intersections of two halfspaces (Q619909) (← links)
- Learning random monotone DNF (Q628302) (← links)
- The hardest halfspace (Q1983325) (← links)
- On the structure of Boolean functions with small spectral norm (Q2012184) (← links)
- PCPs and the hardness of generating synthetic data (Q2210447) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- (Q5092472) (← links)
- Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (Q5891428) (← links)
- Hardness of approximate two-level logic minimization and PAC learning with membership queries (Q5920702) (← links)
- Statistical computational learning (Q6602226) (← links)
- Constant depth formula and partial function versions of MCSP are hard (Q6654556) (← links)
