Proceedings 32nd Annual Symposium of Foundations of Computer Science (1991)
San Juan, Puerto Rico
Oct. 1, 1991 to Oct. 4, 1991
U. Feige , Princeton Univ., NJ, USA
The computational complexity of approximating omega (G), the size of the largest clique in a graph G, within a given factor is considered. It is shown that if certain approximation procedures exist, then EXPTIME=NEXPTIME and NP=P.
approximation procedures, approximating clique, almost NP-complete, computational complexity, graph
S. Safra, S. Goldwasser, L. Lovasz, U. Feige and M. Szegedy, "Approximating clique is almost NP-complete,"  Proceedings 32nd Annual Symposium of Foundations of Computer Science(FOCS), San Juan, Puerto Rico, 1991, pp. 2-12.