Abstract
It was previously known that Max Clique cannot be approximated in polynomial time within n1−ϵ for any constant ϵ > 0, unless NP = ZPP. In this paper, we extend the reductions used to prove this result and combine the extended reductions with a recent result of Samorodnitsky and Trevisan to show that clique cannot be approximated within n1−O(1/√log log n) unless NP ⊆ ZPTIME (2O(log n(log log n)3/2)).
Cite
CITATION STYLE
Engebretsen, L., & Holmerin, J. (2000). Clique is hard to approximate within n1−o(1). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1853, pp. 2–12). Springer Verlag. https://doi.org/10.1007/3-540-45022-x_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
