We prove the following hardness result for anatural promise variant of the classical CNF-satisfiabilityproblem: Given a CNF-formula where each clause has widthw and the guarantee that there exists an assignment satisfyingat least g = [w/2]--1 literals in each clause, it is NP-hard tofind a satisfying assignment to the formula (that sets at leastone literal to true in each clause). On the other hand, when g = [w/2], it is easy to find a satisfying assignment via simplegeneralizations of the algorithms for 2-SAT. Viewing 2-SAT ∈ P as easiness of SAT when 1-in-2 literals are true in every clause, and NP-hardness of 3-SAT as intractability of SAT when 1-in-3 literals are true, our resultshows, for any fixed e > 0, the hardness of finding a satisfyingassignment to instances of "(2 + e)-SAT" where the density ofsatisfied literals in each clause is promised to exceed 1/(2+e). We also strengthen the results to prove that given a (2k + 1)-uniform hypergraph that can be 2-colored such that each edgehas perfect balance (at most k + 1 vertices of either color), itis NP-hard to find a 2-coloring that avoids a monochromaticedge. In other words, a set system with discrepancy 1 is hard todistinguish from a set system with worst possible discrepancy.
[1]
Ran Raz.
A Parallel Repetition Theorem
,
1998,
SIAM J. Comput..
[2]
Elchanan Mossel.
Gaussian Bounds for Noise Correlation of Functions
,
2007,
FOCS 2007.
[3]
Johan Håstad,et al.
Some optimal inapproximability results
,
2001,
JACM.
[4]
Aleksandar Nikolov,et al.
The geometry of differential privacy: the sparse and approximate cases
,
2012,
STOC '13.
[5]
Leen Stougie,et al.
Scheduling over Scenarios on Two Machines
,
2014,
COCOON.
[6]
Carsten Lund,et al.
Proof verification and the hardness of approximation problems
,
1998,
JACM.
[7]
Cenny Wenner.
Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width at Least Four
,
2012,
Theory Comput..
[8]
Johan Håstad,et al.
On the Usefulness of Predicates
,
2012,
2012 IEEE 27th Conference on Computational Complexity.
[9]
C.H. Papadimitriou,et al.
On selecting a satisfying truth assignment
,
1991,
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[10]
Evangelos Kranakis,et al.
Rigorous results for random (2+p)-SAT
,
2001,
Theor. Comput. Sci..