skip to main content
10.1145/3313276.3316359acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
research-article

Faster k-SAT algorithms using biased-PPSZ

Published: 23 June 2019 Publication History

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’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.

References

[1]
Noga Alon and Joel H. Spencer. 2016.
[2]
The probabilistic method (4nd ed.). Wiley-Interscience.
[3]
Stephen A. Cook. 1971. The Complexity of Theorem-Proving Procedures. In Proc. of 3rd STOC. 151–158.
[4]
Timon Hertli. 2014. 3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General. SIAM J. Comput. 43, 2 (2014), 718–729. Announced at FOCS’11.
[5]
Timon Hertli. 2014. Breaking the PPSZ Barrier for Unique 3-SAT. In Proc. of 41st ICALP I. 600–611. 3- 662- 43948- 7_50
[6]
Thomas Hofmeister, Uwe Schöning, Rainer Schuler, and Osamu Watanabe. 2007.
[7]
Randomized Algorithms for 3-SAT. Theory Comput. Syst. 40, 3 (2007), 249–262. 005- 1275- 6
[8]
Russell Impagliazzo and Ramamohan Paturi. 2001. On the Complexity of k-SAT. J. Comput. Syst. Sci. 62, 2 (2001), 367–375.
[9]
Richard M Karp. 1972. Reducibility among combinatorial problems. In Complexity of computer computations. Springer, 85–103.
[10]
Burkhard Monien and Ewald Speckenmeyer. 1985. Solving satisfiability in less than 2 n steps. Discrete Applied Mathematics 10, 3 (1985), 287–295. org/10.1016/0166- 218X(85)90050- 2
[11]
Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, and Francis Zane. 2005. An improved exponential-time algorithm for k-SAT. J. ACM 52, 3 (2005), 337–364. Announced at FOCS’98.
[12]
Ramamohan Paturi, Pavel Pudlák, and Francis Zane. 1999. Satisfiability Coding Lemma. Chicago J. Theor. Comput. Sci. (1999). http://cjtcs.cs.uchicago.edu/ articles/1999/11/contents.html
[13]
Pavel Pudlák, Dominik Scheder, and Navid Talebanfard. 2017.
[14]
Tighter Hard Instances for PPSZ. In Proc. of 44th ICALP (Leibniz International Proceedings in Informatics (LIPIcs)), Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, and Anca Muscholl (Eds.), Vol. 80. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 85:1–85:13.
[15]
Tong Qin and Osamu Watanabe. 2018.
[16]
An Improvement of the Algorithm of Hertli for the Unique 3SAT Problem. In International Workshop on Algorithms and Computation. Springer, 93–105.
[17]
Robert Rodošek. 1996. A New Approach on Solving 3-Satisfiability. In Artificial Intelligence and Symbolic Mathematical Computation, International Conference AISMC-3, Steyr, Austria, September 23-25, 1996, Proceedings. 197–212. 540- 61732- 9_59
[18]
Daniel Rolf. 2005. Derandomization of PPSZ for Uniquek-SAT. In Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings. 216–225. 11499107_16
[19]
Dominik Scheder and John P. Steinberger. 2017. PPSZ for General k-SAT - Making Hertli’s Analysis Simpler and 3-SAT Faster. In 32nd Computational Complexity Conference, CCC 2017, July 6-9, 2017, Riga, Latvia. 9:1–9:15. 4230/LIPIcs.CCC.2017.9
[20]
Uwe Schöning. 2002.
[21]
A Probabilistic Algorithm for k-SAT Based on Limited Local Search and Restart. Algorithmica 32, 4 (2002), 615–623. 1007/s00453- 001- 0094- 7
[22]
Magnus Wahlström. 2005.

Cited By

View all

Index Terms

  1. Faster k-SAT algorithms using biased-PPSZ

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    STOC 2019: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
    June 2019
    1258 pages
    ISBN:9781450367059
    DOI:10.1145/3313276
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 23 June 2019

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. randomized algorithm
    2. satisfiability

    Qualifiers

    • Research-article

    Funding Sources

    Conference

    STOC '19
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

    Upcoming Conference

    STOC '25
    57th Annual ACM Symposium on Theory of Computing (STOC 2025)
    June 23 - 27, 2025
    Prague , Czech Republic

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)57
    • Downloads (Last 6 weeks)8
    Reflects downloads up to 19 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Entanglement Trajectory and its BoundaryQuantum10.22331/q-2024-03-14-12828(1282)Online publication date: 14-Mar-2024
    • (2024)Efficient Quantum Circuit Synthesis for SAT-Oracle With Limited Ancillary QubitIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2023.332597443:3(868-877)Online publication date: Mar-2024
    • (2024)PPSZ for General k-SAT and CSP—Making Hertli’s Analysis Simpler and 3-SAT FasterComputational Complexity10.1007/s00037-024-00259-y33:2Online publication date: 4-Nov-2024
    • (2023)Hybrid divide-and-conquer approach for tree search algorithmsQuantum10.22331/q-2023-03-23-9597(959)Online publication date: 23-Mar-2023
    • (2023)Mind the Gap: Achieving a Super-Grover Quantum Speedup by Jumping to the EndProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585203(1131-1144)Online publication date: 2-Jun-2023
    • (2023)Algorithmic Applications of Hypergraph and Partition ContainersProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585163(985-998)Online publication date: 2-Jun-2023
    • (2023)Quantum hybrid algorithm for solving SAT problemEngineering Applications of Artificial Intelligence10.1016/j.engappai.2023.106058121(106058)Online publication date: May-2023
    • (2022)An Improvement of the Biased-PPSZ Algorithm for the 3SAT ProblemIEICE Transactions on Information and Systems10.1587/transinf.2021FCP0009E105.D:3(481-490)Online publication date: 1-Mar-2022
    • (2022)Quantum computing for software engineering: prospectsProceedings of the 1st International Workshop on Quantum Programming for Software Engineering10.1145/3549036.3562060(22-25)Online publication date: 7-Nov-2022
    • (2022)A Grover based Quantum Algorithm for Finding Pure Nash Equilibria in Graphical Games2022 IEEE 19th International Conference on Software Architecture Companion (ICSA-C)10.1109/ICSA-C54293.2022.00036(147-151)Online publication date: Mar-2022
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media