Hardness of Approximation Algorithms on k-SAT and (k,s)-SAT Problems

k-CNF is the class of CNF formulas in which the length of each clause of every formula is k. The decision problem asks for an assignment of truth values to the variables that satisfies all the clauses of a given CNF formula. k-SAT problem is k-CNF´s decision problem. Cook has shown that k-SAT is NP-complete for k ges 3. (k,s)-CNF is the class of CNF formulas with each clause has exactly length k and each variable occurs at most k times. (k,s)-SAT is (k,s)-CNF´s decision problem. NP=PCP(log,1) is called PCP theorem, and it is equivalent to that there exists some constant r >1 such that (3SAT, r-UN3SAT)(or denoted as (1-1/r)-GAP3SAT) is NP-complete [1][2]. In this paper, we show that there exists some r >1 such that (k-SAT, r-UN-k-SAT) is NP-complete for k ges 3 , and prove that for some r >1 the approximation problem r-Approx-k-SAT is NP-hard for k ges 3. Based on the application of linear MU formulas, we construct a reduction from (3SAT, r-UN3SAT) to ((3,4)-SAT, r´-UN-(3,4)-SAT), and prove that there exists some r >1 such that ((3,4)-SAT, r-UN-(3,4)-SAT) is NP-complete, so for some constant s >1 the approximation problem s-Approx-(3,4)-SAT has no efficient algorithm to solve.