Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems

For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task is to find a satisfying assignment with at least/exactly k variables set to 1, respectively. We study the parameterized complexity of these problems, including the question whether they admit polynomial kernels. For Max Ones SAT(Γ), we give a classification into 5 different complexity levels: polynomial-time solvable, admits a polynomial kernel, fixed-parameter tractable, solvable

• Type: Journal
• Year: 2010
• Where: MFCS
• Authors: Stefan Kratsch, Dániel Marx, Magnus Wahlström
• Keywords: Different Complexity Levels, Max Ones, MFCS 2010, Polynomial Kernel, Theoretical Computer Science