Proceedings of 37th Conference on Foundations of Computer Science (1996)
Oct. 14, 1996 to Oct. 16, 1996
J. Hastad , R. Inst. of Technol., Stockholm, Sweden
The author proves that unless NP=coR, Max Clique is hard to approximate in polynomial time within a factor n1-ε for any ε>0. This is done by, for any δ>0, constructing a proof system for NP which uses δ amortized free bits. A central lemma, which might be of independent interest, gives sufficient conditions (in the form of a certain type of agreement) for creating a global function from local functions certain local consistency conditions.
computational complexity; Max Clique approximation; polynomial time; proof system; amortized free bits; global function; local functions; local consistency conditions
J. Hastad, "Clique is hard to approximate within n1-ε," Proceedings of 37th Conference on Foundations of Computer Science(FOCS), Burlington, VT, 1996, pp. 627.