2 search results - page 1 / 1 » Cryptographic Hardness for Learning Intersections of Halfspa... |
88
Voted
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness...
78
Voted
ECCC
2006
14 years 11 months ago
2006
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness ...