On the Approximation Resistance of a Random Predicate

Abstract.A predicate is called approximation resistant if it is NP-hard to approximate the corresponding constraint satisfaction problem significantly better than what is achieved by the naive algorithm that picks an assignment uniformly at random. In this paper we study predicates of Boolean inputs where the width of the predicate is allowed to grow. Samorodnitsky and Trevisan proved that, assuming the Unique Games Conjecture, there is a family of very sparse predicates that are approximation resistant. We prove that, under the same conjecture, any predicate implied by their predicate remains approximation resistant and that, with high probability, this condition applies to a randomly chosen predicate.

[1]  Johan Håstad,et al.  On the Approximation Resistance of a Random Predicate , 2007, computational complexity.

[2]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[3]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[4]  Mihir Bellare,et al.  Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..

[5]  Gustav Hast,et al.  Beating a Random Assignment , 2005, APPROX-RANDOM.

[6]  Uri Zwick,et al.  Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint , 1998, SODA '98.

[7]  Johan Håstad.  Every 2-CSP allows nontrivial approximation , 2005, STOC '05.

[8]  Luca Trevisan,et al.  Gowers Uniformity, Influence of Variables, and PCPs , 2009, SIAM J. Comput..

[9]  W. T. Gowers,et al.  A NEW PROOF OF SZEMER ´ EDI'S THEOREM , 2001 .

[10]  Luca Trevisan,et al.  A PCP characterization of NP with optimal amortized query complexity , 2000, STOC '00.

[11]  Subhash Khot.  On the power of unique 2-prover 1-round games , 2002, STOC '02.

[12]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[13]  W. T. Gowers,et al.  A New Proof of Szemerédi's Theorem for Arithmetic Progressions of Length Four , 1998 .

[14]  Venkatesan Guruswami,et al.  A tight characterization of NP with 3 query PCPs , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

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