Approximating clique is almost NP-complete (1991)

by U FEIGE, S GOLDWASSER, L LOVASZ, S SAFRA, M SZEGEDY
Venue:In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science (FOCS) (San Juan, PR