Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses

摘要

We prove hardness results for approximating set splitting problems and also instances of satisfiability problems which have no mixed clauses, i.e., every clause has either all its literals unnegated or all of them negated. Results of Hastad [5] imply tight hardness results for set splitting when all sets have size exactly k ≥ 4 elements and also for non-mixed satisfiability problems with exactly k literals in each clause for k ≥ 4. We consider the case k=3. For the MAX E3-SET SPLITTING, problem in which all sets have size exactly 3, we prove an NP-hardness result for approximating within any factor better than 19/20. This result holds even for satisfiable instances of MAX E3-SET SPLITTING, and is based on a PCP construction due to Hostad [5]. For non-mixed MAX 3SAT, we give a PCP construction which is a slight variant of the one given by H0stad for MAX 3SAT, and use it to prove the NP-hardness of approximating within a factor better than 11/12.