On the parameterized complexity of (k, s)-SAT

Abstract Let ( k , s ) -SAT be the k-SAT problem restricted to formulas in which each variable occurs in at most s clauses. It is well known that ( 3 , 3 ) -SAT is trivial and ( 3 , 4 ) -SAT is NP -complete. Answering a question posed by Iwama and Takaki (DMTCS 1997), Berman, Karpinski and Scott (DAM 2007) gave, for every fixed t ≥ 0 , a polynomial-time algorithm for ( 3 , 4 ) - SAT restricted to formulas in which the number of variables that occur in four clauses is t. Parameterized by t, their algorithm runs in XP time. We extend their result by giving, for every k ≥ 3 and s ≥ k , an FPT algorithm for ( k , s ) -SAT when parameterized by the number t of variables occurring in more than k clauses.

[1]  Craig A. Tovey,et al.  A simplified NP-complete satisfiability problem , 1984, Discret. Appl. Math..

[2]  Stefan Szeider,et al.  Citation for Published Item: Use Policy Minimal Unsatisfiable Formulas with Bounded Clause-variable Difference Are Fixed-parameter Tractable , 2022 .

[3]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[4]  Stefan Szeider,et al.  Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable , 2003, COCOON.

[5]  Heidi Gebauer.  Disproof of the Neighborhood Conjecture with Implications to SAT , 2009, ESA.

[6]  Kazuo Iwama,et al.  Satisfiability of 3CNF formulas with small clause/variable-ratio , 1996, Satisfiability Problem: Theory and Applications.

[7]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[8]  Zsolt Tuza,et al.  One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete , 1993, SIAM J. Comput..

[9]  J.,et al.  THE R.A. , 2003 .

[10]  Olivier Dubois,et al.  On the r, s-SAT satisfiability problem and a conjecture of Tovey , 1989, Discret. Appl. Math..

[11]  Ewald Speckenmeyer,et al.  Solving satisfiability in less than 2n steps , 1985, Discret. Appl. Math..

[12]  Stefan Szeider,et al.  Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference , 2002, Theor. Comput. Sci..

[13]  Stefan Szeider,et al.  Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable , 2005, SAT.

[14]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[15]  Marek Karpinski,et al.  Computational complexity of some restricted instances of 3-SAT , 2007, Discret. Appl. Math..

[16]  Marek Karpinski,et al.  Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT , 2003, Electron. Colloquium Comput. Complex..