We show that the class of sets having polynomial size circuits,P=poly, hasEXPNP-measure zero under each of the following two assumptions: EXPNP 6= ZPP p2 (which holds if the polynomial time hierarchyâ€¦ (More)

We introduce a combinatorial dimension that characterizes the number of queries needed to exactly (or approximately) learn concept classes in various models. Our general dimension provides tightâ€¦ (More)

We study the parameterized complexity of learning k-juntas and some variations of juntas. We show the hardness of learning k-juntas and subclasses of k-juntas in the PAC model by reductions from aâ€¦ (More)

Abstrac t . We consider representation classes of polynomial query complexity in Angluin's exact learning model with all three possible combinations of membership and (proper) equivalence queriesâ€¦ (More)

We study the learnability of representation classes in Angluin's exact learning model. In particular, we consider the following three query types: equivalence queries, equivalence and membershipâ€¦ (More)

We study the parameterized complexity of learning k-juntas and some variations of juntas. We show the hardness of learning k-juntas and subclasses of k-juntas in the PAC model by reductions fromâ€¦ (More)