Abstract
Håstad established that any predicate P ⊆ {0,1}m containing parity of width at least three is approximation resistant for almost satisfiable instances. However, in comparison to for example the approximation hardness of Max-3SAT, the result only holds for almost satisfiable instances. This limitation was mitigated by O’Donnell, Wu, and Huang under the d-to-1 Conjecture. They showed the threshold result that if a predicate \(\textit{strictly}\) contains parity of width at least three, then it is approximation resistant also for satisfiable instances. We extend modern hardness of approximation techniques by Mossel et al. to projection games, eliminating dependencies on the degree of projections via Smooth Label Cover, and prove unconditionally the same approximation resistance result for predicates of width four.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Austrin, P., Håstad, J.: Randomly Supported Independence and Resistance. In: ACM Symp. on the Theory of Comp. (STOC), vol. 41 (2009)
Austrin, P., Mossel, E.: Approximation Resistant Predicates from Pairwise Independence. In: IEEE Conf. on Comp. Complexity (CCC), vol. 23 (2008)
Chen, V.: A Hypergraph Dictatorship Test with Perfect Completeness. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX and RANDOM 2009. LNCS, vol. 5687, pp. 448–461. Springer, Heidelberg (2009)
Chen, V.: Property Testing. Springer (2010)
Feldman, V., Guruswami, V., Raghavendra, P., Yi, W.: Agnostic Learning of Monomials by Halfspaces is Hard. In: (FOCS) IEEE Found. of Comp. Sc., vol. 50 (2009)
Guruswami, V., Raghavendra, P., Saket, R.: Bypassing UGC from Some Optimal Geometric Inapproximability Results. In: ACM-SIAM Symp. on Discrete Alg. (SODA), vol. 23 (2012)
Håstad, J.: On Linear Equations and Satisfiability (2011) (unpublished material)
Håstad, J.: On the NP-Hardness of Max-Not-2. In: Gupta, A., et al. (eds.) APPROX/RANDOM 2012. LNCS, vol. 7408, pp. 170–181. Springer, Heidelberg (2012)
Håstad, J.: Some Optimal Inapproximability Results. J. of ACM 48 (2001)
Huang, S.: Approximation Resistance on Satisfiable Instances for Predicates Strictly Dominating Parity. Elect. C. on Comp. Complexity (ECCC) (2012)
Khot, S.: Hardness Results for Coloring 3-Colorable 3-Uniform Hypergraphs. In: IEEE Foundations of Comp. Sc. (FOCS), vol. 43 (2002)
Khot, S.: On the Power of Unique 2-Prover 1-Round Games. In: ACM Symp. on the Theory of Comp. (STOC), vol. 34 (2002)
Khot, S., Saket, R.: A 3-query Non-Adaptive PCP with Perfect Completeness. In: Conf. on Comp. Complexity (CCC), vol. 21 (2006)
Mossel, E.: Gaussian Bounds for Noise Correlation of Functions. In: Geometric and Functional Analysis. Birkhauser, Basel (2010)
Mossel, E.: Gaussian Bounds for Noise Correlation of Functions and Tight Analysis of Long Codes. In: IEEE Found. of Comp. Sc. (FOCS), vol. 49 (2008)
Mossel, E., O’Donnell, R., Oleszkiewicz, K.: Noise stability of Functions with Low Influences: Invariance and Optimality. In: IEEE Foundations of Comp. Sc. (FOCS), vol. 46 (2005)
O’Donnell, R., Wright, J.: A New Point of NP-hardness for Unique Games. In: ACM Symp. on the Theory of Comp. (STOC), vol. 44 (2012)
O’Donnell, R., Yi, W.: 3-Bit Dictator Testing: 1 vs. 5/8. In: ACM-SIAM Symp. on Discrete Alg. (SODA), vol. 20 (2009)
O’Donnell, R., Wu, Y.: Conditional Hardness for Satisfiable 3-CSPs. In: ACM Symp. on the Theory of Comp. (STOC), vol. 41 (2009)
Tamaki, S., Yoshida, Y.: A Query Efficient Non-Adaptive Long Code Test with Perfect Completeness. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX and RANDOM 2010, LNCS, vol. 6302, pp. 738–751. Springer, Heidelberg (2010)
Tang, L.: Conditional Hardness of Approximating Satisfiable Max 3CSP-q. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 923–932. Springer, Heidelberg (2009)
Wenner, C.: Noise Introduction and Multivariate Invariance for Projection Games (2012) (unpublished manuscript)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wenner, C. (2012). Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width Four. In: Gupta, A., Jansen, K., Rolim, J., Servedio, R. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2012 2012. Lecture Notes in Computer Science, vol 7408. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32512-0_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-32512-0_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32511-3
Online ISBN: 978-3-642-32512-0
eBook Packages: Computer ScienceComputer Science (R0)