3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General

@article{Hertli20113SATFA,
  title={3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General},
  author={Timon Hertli},
  journal={2011 IEEE 52nd Annual Symposium on Foundations of Computer Science},
  year={2011},
  pages={277-284}
}
  • Timon Hertli
  • Published 2011
  • Mathematics, Computer Science
  • 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
  • The PPSZ algorithm by Paturi, Pudl\'ak, Saks, and Zane [1998] is the fastest known algorithm for Unique k-SAT, where the input formula does not have more than one satisfying assignment. For k>=5 the same bounds hold for general k-SAT. We show that this is also the case for k=3,4, using a slightly modified PPSZ algorithm. We do the analysis by defining a cost for satisfiable CNF formulas, which we prove to decrease in each PPSZ step by a certain amount. This improves our previous best bounds… CONTINUE READING
    90 Citations

    Topics from this paper

    Paper Mentions

    Breaking the PPSZ Barrier for Unique 3-SAT
    • 9
    • PDF
    Faster k-SAT algorithms using biased-PPSZ
    • 10
    • Highly Influenced
    The PPSZ Algorithm for Constraint Satisfaction Problems on More Than Two Colors
    • 3
    • PDF
    Improved Exponential Algorithms for SAT and ClSP
    • 4
    A new upper bound for (n, 3)-MAX-SAT
    • 8
    Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT
    • Sixue Liu
    • Mathematics, Computer Science
    • ICALP
    • 2018
    • 9
    • PDF
    Tighter Hard Instances for PPSZ
    • 8
    • PDF

    References

    SHOWING 1-10 OF 16 REFERENCES
    Improved Bound for the PPSZ/Schöning-Algorithm for 3-SAT
    • D. Rolf
    • Mathematics, Computer Science
    • J. Satisf. Boolean Model. Comput.
    • 2006
    • 42
    • PDF
    Improved upper bounds for 3-SAT
    • 123
    • Highly Influential
    • PDF
    Derandomization of PPSZ for Unique- k-SAT
    • D. Rolf
    • Computer Science, Mathematics
    • SAT
    • 2005
    • 22
    • PDF
    A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
    • 154
    • Highly Influential
    • PDF
    Improved Randomized Algorithms for 3-SAT
    • 22
    • Highly Influential
    An improved exponential-time algorithm for k-SAT
    • 232
    • Highly Influential
    • PDF
    Derandomizing the HSSW Algorithm for 3-SAT
    • 12
    • PDF
    Improving PPSZ for 3-SAT using Critical Variables
    • 25
    • PDF
    The complexity of unique k-SAT: an isolation lemma for k-CNFs
    • 62
    • PDF
    Derandomizing HSSW Algorithm for 3-SAT
    • 13