1. Complexity theoretic hardness results for query learning;Aizenstein;J. Complexity,1998
2. H. Aizenstein, L. Hellerstein, L. Pitt, Read-thrice DNF is hard to learn with membership and equivalence queries, Proc. FOCS-92, 1992, pp. 523–532.
3. M. Anthony, Threshold functions, decision lists and neural networks, Technical Report NC-TR-96-028, NeuroCOLT Technical Report Series, January 1996.
4. Computational Learning Theory;Anthony,1992
5. On specifying Boolean functions by labelled examples;Anthony;Discrete Appl. Math.,1995