Advertisement
Published in:
2012 | OriginalPaper | Chapter
A New Algorithm for Parameterized MAX-SAT
Authors : Ivan Bliznets, Alexander Golovnev
Published in: Parameterized and Exact Computation
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We show how to check whether at least k clauses of an input formula in CNF can be satisfied in time
O
*
(1.358
k
). This improves the bound
O
*
(1.370
k
) proved by Chen and Kanj more than 10 years ago. Though the presented algorithm is based on standard splitting techniques its core are new simplification rules that often allow to reduce the size of case analysis. Our improvement is based on a simple algorithm for a special case of MAX-SAT where each variable appears at most 3 times.