Abstract
The PPSZ algorithm (Paturi et al., FOCS 1998) is the fastest known algorithm for k-SAT. We show how to extend the algorithm and its analysis to (d, k)-Clause Satisfaction Problems where each variable ranges over d different values. Given an input instance with a unique satisfying assignment, the resulting algorithm is the fastest known algorithm for (d, k)-CSP except when (d, k) is (3, 2) or (4, 2). For the general case of multiple satisfying assignments, our algorithm is the fastest known for all k ≥ 4.
Cite
CITATION STYLE
Hertli, T., Hurbain, I., Millius, S., Moser, R. A., Scheder, D., & Szedlák, M. (2016). The PPSZ algorithm for constraint satisfaction problems on more than two colors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9892 LNCS, pp. 421–437). Springer Verlag. https://doi.org/10.1007/978-3-319-44953-1_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
