Unformatted text preview: ∀ ρ > 0, GAP-CLIQUE 1 ,ρ is NP-hard) using the powering graph (similar to the one we used to show the hardness of approximation of Independent Set). That is, for a graph G = ( V,E ) and an integer k ≥ 2, you need to deﬁne the k th power of G , G k = ( V ,E ) such that ω ( G k ) = ω ( G ) k where ω ( . ) deﬁnes the size of largest cliques in (.). From there, prove the theorem. Problem 6 . Show that there exits a δ > 0, GAP-CLIQUE 1 ,n-δ is NP-hard. As hinted in the lecture note, you may want to choose k to be supper-constant, then the veriﬁer needs a total of O ( k log n )random bits, then the size of G becomes supper-polynomial. Try to show that we can run the veriﬁer k times by using only O (log n ) + O ( k ) (rather than O ( k log n ))...
View Full Document
- Spring '08
- Trigraph, Computational complexity theory, 10 pts, NP-complete