A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
[chapter]
2010
Lecture Notes in Computer Science
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,
doi:10.1007/978-3-642-15155-2_43
fatcat:nuloby4el5agdil6gaq6dtgnhq