Approximating clique is almost NP-complete (1991)

by U Feige, S Goldwasser, L Lovász, S Safra, M Szegedy
Venue:in: Proc. 32nd Annual Symp. on Foundations of Computer Science