Derandomizing HSSW Algorithm for 3-SAT
Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
TL;DR
This paper provides a fully derandomized version of the HSSW algorithm for 3-SAT, achieving the fastest known deterministic algorithm with a runtime of O(1.3303^n).
Contribution
It introduces a complete derandomization of the HSSW algorithm, improving the deterministic runtime for 3-SAT solving.
Findings
Achieves a deterministic 3-SAT algorithm with runtime O(1.3303^n)
Outperforms previous deterministic algorithms in speed
Provides a new approach to derandomize existing randomized algorithms
Abstract
We present a (full) derandomization of HSSW algorithm for 3-SAT, proposed by Hofmeister, Sch\"oning, Schuler, and Watanabe in [STACS'02]. Thereby, we obtain an O(1.3303^n)-time deterministic algorithm for 3-SAT, which is currently fastest.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Complexity and Algorithms in Graphs · Coding theory and cryptography