TY - GEN
T1 - Faster k-SAT algorithms using Biased-PPSZ
AU - Hansen, Thomas Dueholm
AU - Kaplan, Haim
AU - Zamir, Or
AU - Zwick, Uri
N1 - Publisher Copyright: © 2019 Association for Computing Machinery.
PY - 2019/6/23
Y1 - 2019/6/23
N2 - The PPSZ algorithm, due to Paturi, Pudlak, Saks and Zane, is currently the fastest known algorithm for the k-SAT problem, for every k > 3. For 3-SAT, a tiny improvement over PPSZ was obtained by Hertli. We introduce a biased version of the PPSZ algorithm using which we obtain an improvement over PPSZ for every k ≥ 3. For k = 3 we also improve on Herli’s result and get a much more noticeable improvement over PPSZ, though still relatively small. In particular, for Unique 3-SAT, we improve the current bound from 1.308n to 1.307n.
AB - The PPSZ algorithm, due to Paturi, Pudlak, Saks and Zane, is currently the fastest known algorithm for the k-SAT problem, for every k > 3. For 3-SAT, a tiny improvement over PPSZ was obtained by Hertli. We introduce a biased version of the PPSZ algorithm using which we obtain an improvement over PPSZ for every k ≥ 3. For k = 3 we also improve on Herli’s result and get a much more noticeable improvement over PPSZ, though still relatively small. In particular, for Unique 3-SAT, we improve the current bound from 1.308n to 1.307n.
KW - Randomized algorithm
KW - Satisfiability
UR - http://www.scopus.com/inward/record.url?scp=85068739641&partnerID=8YFLogxK
U2 - https://doi.org/10.1145/3313276.3316359
DO - https://doi.org/10.1145/3313276.3316359
M3 - منشور من مؤتمر
T3 - Proceedings of the Annual ACM Symposium on Theory of Computing
SP - 578
EP - 589
BT - STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
A2 - Charikar, Moses
A2 - Cohen, Edith
T2 - 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019
Y2 - 23 June 2019 through 26 June 2019
ER -