Name
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. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-44953-1_27 | PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2016 |
Field | DocType | Volume |
Discrete mathematics,Mathematical optimization,Computer science,Algorithm,Constraint satisfaction problem,Hybrid algorithm (constraint satisfaction) | Conference | 9892 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
8 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Timon Hertli | 1 | 30 | 2.46 |
| Isabelle Hurbain | 2 | 0 | 0.34 |
| Sebastian Millius | 3 | 0 | 0.34 |
| Robin A. Moser | 4 | 240 | 12.51 |
| Dominik Scheder | 5 | 85 | 13.54 |
| May Szedlák | 6 | 5 | 2.21 |