3-bit Dictator Testing: 1 vs. 5/8

In the conclusion of his monumental paper on optimal inapproximability results, Hastad [13] suggested that Fourier analysis of Dictator (Long Code) Tests may not be universally applicable in the study of CSPs. His main open question was to determine if the technique could resolve the approximability of satisfiable 3-bit constraint satisfaction problems. In particular, he asked if the "Not Two" (NTW) predicate is non-approximable beyond the random assignment threshold of 5/8 on satisfiable instances. Around the same time, Zwick [30] showed that all satisfiable 3-CSPs are 5/8-approximable and conjectured that the 5/8 is optimal. In this work we show that Fourier analysis techniques can produce a Dictator Test based on NTW with completeness 1 and soundness 5/8. Our test's analysis uses the Bonami-Gross-Beckner hypercontractive inequality. We also show a soundness lower bound of 5/8 for all 3-query Dictator Tests with perfect completeness. This lower bound for Property Testing is proved in part via a semidefinite programming algorithm of Zwick [30]. Our work precisely determines the 3-query "Dictatorship Testing gap". Although this represents progress on Zwick's conjecture, current PCP "outer verifier" technology is insufficient to convert our Dictator Test into an NP-hardness-of-approximation result.

[1]  Dana Ron,et al.  Testing Basic Boolean Formulae , 2002, SIAM J. Discret. Math..

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

[3]  Arild Stubhaug.  Acta Mathematica , 1886, Nature.

[4]  DinurIrit.  The PCP theorem by gap amplification , 2007 .

[5]  Subhash Khot,et al.  A 3-query non-adaptive PCP with perfect completeness , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[6]  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).

[7]  Irit Dinur,et al.  The PCP theorem by gap amplification , 2006, STOC.

[8]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[9]  Ben Green,et al.  Finite field models in additive combinatories , 2004, BCC.

[10]  Luca Trevisan,et al.  Gowers uniformity, influence of variables, and PCPs , 2005, STOC '06.

[11]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

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

[13]  Luca Trevisan.  Approximating Satisfiable Satisfiability Problems , 2000, Algorithmica.

[14]  Luca Trevisan,et al.  Gadgets, Approximation, and Linear Programming , 2000, SIAM J. Comput..

[15]  Johan Håstad,et al.  Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[16]  Ryan O'Donnell,et al.  SDP gaps and UGC-hardness for MAXCUTGAIN , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[17]  Guy Kindler,et al.  Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[18]  Ryan O'Donnell,et al.  An optimal sdp algorithm for max-cut, and equally optimal long code tests , 2008, STOC.

[19]  Subhash Khot,et al.  On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[20]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[21]  Jonas Holmerin,et al.  Three-query PCPs with perfect completeness over non-Boolean domains , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[22]  A. Bonami.  Ensembles $\Lambda (p)$ dans le dual de $D^\infty $ , 1968 .

[23]  Ryan O'Donnell,et al.  Noise stability of functions with low influences: Invariance and optimality , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[24]  Uri Zwick,et al.  A 7/8-approximation algorithm for MAX 3SAT? , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[25]  Prasad Raghavendra,et al.  Optimal algorithms and inapproximability results for every CSP? , 2008, STOC.

[26]  Nisheeth K. Vishnoi,et al.  The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1 , 2005, FOCS.

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

[28]  Uri Zwick,et al.  Computer assisted proof of optimal approximability results , 2002, SODA '02.

[29]  Venkatesan Guruswami,et al.  Hardness of Max 3SAT with no mixed clauses , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

[30]  Daniel Stefankovic.  Fourier Transforms in Computer Science , 2000 .