1. Arora S., Lund C., Motwani R., Sudan M., Szegedy M.: Proof verification and hardness of approximation problems. Proc. 33-rd Ann. IEEE Symp. on Foundations of Computer Science (1992) 14–23
2. Ausiello G., Crescenzi P., Protasi M.: Approximate Solution of NP Optimization Problems Technical Report SI/RR-94/03, Universita di Roma “La Sapienza” (1994)
3. Crescenzi P., Kann V., Trevisan L.; On the structure of the classes NPO and APX. Manuscript in preparation (1994)
4. Crescenzi P., Panconesi A.: Completeness in approximation classes. Information and Computation 93 (1991) 241–262
5. Crescenzi P., Silvestri R.: Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems. Information Processing Letters 33 (1990) 221–226