1. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, Marchetti Spaccamela A., and Protasi M. Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties. Springer-Verlag, Berlin, 1999. 226
2. S. Arora. Probabilistic checking of proofs and hardness of approximation problems. Technical Report CS-TR-476-94, Princeton University, 1994. 225, 228
3. M. Bellare. Proof checking and Approximation: towards tight results. SIGACT news, 1996. 225, 228
4. L. Breiman, J. H. Freidman, R. A. Olshen, and C. J. Stone. Classification and Regression Trees. Wadsworth, 1984. 227
5. A. Blum and P. Langley. Selection of relevant features and examples in machine learning. Artificial Intelligence, pages 245–272, 1997. 225, 227, 235