hw1 - > 0, GAP-CLIQUE 1 , is NP-hard) using the powering...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CIS6930: PCPs and Inapproximability - Homework 1 Due at the beginning of the lecture on 10-13-2009 . No late assignment will be accepted. Do the following 6 required problems. Each problem is 10 pts. Problem 1 . Give a gap preserving reduction from MAX-3SAT(29) to MAX-3SAT(5) with appropriate parameters to show the hardness of the latter problem. Problem 2 . Give a gap preserving reduction from MAX-3SAT(d) to MAX-E3SAT(Ed) (each variable appears exactly d times) to show the hardness of the latter problem, that is, GAP-MAX-E3SAT(E d ) 1 is NP-hard for a constant 0 < ρ < 1 Problem 3 . Prove that NP = PCP 1 , 1 /n [log n, log n ] Problem 4 . Show that if there exists an ± > 0 for which there is a (1+2 /e - ± )-approximation algorithm for the metric k -Median problem, then NP DTIME ( n O (log log n ) ). Problem 5 . In the class, we mentioned that ρ > 0, GAP-CLIQUE 1 is NP-hard by run- ning PCP verifier k times. Now, prove that theorem (
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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 dene the k th power of G , G k = ( V ,E ) such that ( G k ) = ( G ) k where ( . ) denes 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 verier 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 verier k times by using only O (log n ) + O ( k ) (rather than O ( k log n ))...
View Full Document

This note was uploaded on 05/20/2011 for the course CIS 6930 taught by Professor Staff during the Spring '08 term at University of Florida.

Ask a homework question - tutors are online