@inproceedings{cd8093275ea74c04a49efc2ec9e3dbec,
title = "Faster k-SAT algorithms using Biased-PPSZ",
abstract = "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{\textquoteright}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.",
keywords = "Randomized algorithm, Satisfiability",
author = "Hansen, \{Thomas Dueholm\} and Haim Kaplan and Or Zamir and Uri Zwick",
note = "Publisher Copyright: {\textcopyright} 2019 Association for Computing Machinery.; 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019 ; Conference date: 23-06-2019 Through 26-06-2019",
year = "2019",
month = jun,
day = "23",
doi = "10.1145/3313276.3316359",
language = "الإنجليزيّة",
series = "Proceedings of the Annual ACM Symposium on Theory of Computing",
publisher = "Association for Computing Machinery",
pages = "578--589",
editor = "Moses Charikar and Edith Cohen",
booktitle = "STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing",
address = "الولايات المتّحدة",
}