1. Arora, S., Lund, C., Motwani, R., Sudan, M., and Szegedy, M. (1992), “Proof verification and hardness of approximation problems”, Proc. of 33rd Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE Computer Society, 14–23.
2. Berman, P., and Schnitger, G. (1992), “On the complexity of approximating the independent set problem”, Inform. and Comput.
96, 77–94.
3. Bovet, D.P., and Crescenzi, P. (1993), Introduction to the theory of complexity. Prentice Hall.
4. Chang, R. (1994), “On the query complexity of clique size and maximum satisfiability”, Proc. 9th Ann. Structure in Complexity Theory Conf., IEEE Computer Society, 31–42 (an extended version is available as Technical Report TR-CS-95-01, Department of Computer Science, University of Maryland Baltimore County, April 1995).
5. Chang, R. (1994), “A machine model for NP-approximation problems and the revenge of the Boolean hierarchy”, EATCS Bulletin
54, 166–182.