Approximating Clique is Almost NP-Complete (Preliminary Version)

Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, Mario Szegedy. Approximating Clique is Almost NP-Complete (Preliminary Version). In 32nd Annual Symposium on Foundations of Computer Science, 1-4 October 1991, San Juan, Puerto Rico. pages 2-12, IEEE, 1991.

Abstract

Abstract is missing.