1. D. Anguin, Learning k-term-DNF formulas using queries and counterexamples, Technical Report YALEU/RR-559, Yale University, Department of Computer Science, 1987.
2. Learning from noisy examples;Anguin;Machine Learning,1988
3. PAC learning of concept classes through the boundaries of their items;Apolloni;J. Theoret. Comput. Sci.,1997
4. B. Apolloni, C. Gentile, G. Mauri, Noisy oracles for learning k-term DNF formulas, Proc. AIIA 1994, pp. 38–41.
5. Structural Complexity I;Balcazar,1988