Clique Is Hard To Approximate Within

[1]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[2]  Mihir Bellare,et al.  Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[3]  Ran Raz,et al.  A parallel repetition theorem , 1995, STOC '95.

[4]  Ravi B. Boppana,et al.  Approximating maximum independent sets by excluding subgraphs , 1990, BIT.