论文信息 - (2+ε)-Sat Is NP-hard

(2+ε)-Sat Is NP-hard

We prove the following hardness result for a natural promise variant of the classical CNF-satisfiability problem: Given a CNF-formula where each clause has width w and the guarantee that there exis ...

[1] Venkatesan Guruswami,et al. Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs , 2015, SODA.

[2] Ran Raz. A Parallel Repetition Theorem , 1998, SIAM J. Comput..

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

[4] Evangelos Kranakis,et al. Rigorous results for random (2+p)-SAT , 2001, Theor. Comput. Sci..

[5] Aleksandar Nikolov,et al. Tight hardness results for minimizing discrepancy , 2011, SODA '11.

[6] Elchanan Mossel. Gaussian Bounds for Noise Correlation of Functions , 2007, FOCS 2007.

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

[8] Cenny Wenner. Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width Four - (Extended Abstract) , 2012, APPROX-RANDOM.

[9] Leen Stougie,et al. Scheduling over Scenarios on Two Machines , 2014, COCOON.

[10] Aleksandar Nikolov,et al. The geometry of differential privacy: the sparse and approximate cases , 2012, STOC '13.

[11] Johan Håstad,et al. On the Usefulness of Predicates , 2012, 2012 IEEE 27th Conference on Computational Complexity.