1 citations · 1 across the 1 of their papers we have counts for
Showing 2022 · cs.CCShow all
2 papers · 2 filters
cs.CC2022
On the Parallel Parameterized Complexity of MaxSAT Variants
Max Bannach, Malte Skambath, Till Tantau
In the maximum satisfiability problem (MAX-SAT) we are given a propositional formula in conjunctive normal form and have to find an assignment that satisfies as many clauses as pos…
cs.CC2022
MaxSAT with Absolute Value Functions: A Parameterized Perspective
Max Bannach, Pamela Fleischmann, Malte Skambath
The natural generalization of the Boolean satisfiability problem to optimization problems is the task of determining the maximum number of clauses that can simultaneously be satisf…