论文部分内容阅读
For fixed positive integers k and s,a(k; s)-CNF-formula means that every clause has exactly k literals and each variable occurs at most s clauses in the formula.It is shown that for k ≥ 3 there is some integer s = f(k)such that(1)all formulas in(k; s)-CNF are satisfiable;(2)(k,s + 1)-SAT problem is already NP-complete.