Derandomizing HSSW algorithm for 3-SAT

Authors:
Kazuhisa Makino;Suguru Tamaki;Masaki Yamamoto
Affiliations:
Graduate School of Information Science and Technology, University of Tokyo;Graduate School of Informatics, Kyoto University;Dept. of Informatics, Kwansei-Gakuin University
Venue:
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Year:
2011

Citing 13
Cited 1

Derandomizing Approximation Algorithms Based on Semidefinite Programming

SIAM Journal on Computing
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search

Theoretical Computer Science
A Probabilistic 3-SAT Algorithm Further Improved

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Satisfiability Coding Lemma

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
An Improved Exponential-Time Algorithm for k-SAT

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Improved upper bounds for 3-SAT

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An improved deterministic local search algorithm for 3-SAT

Theoretical Computer Science
Undirected connectivity in log-space

Journal of the ACM (JACM)
Solving satisfiability in less than 2n steps

Discrete Applied Mathematics
Guided search and a faster deterministic algorithm for 3-SAT

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Deterministic algorithms for the Lovász Local Lemma

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A full derandomization of schöning's k-SAT algorithm

Proceedings of the forty-third annual ACM symposium on Theory of computing

Exploiting independent subformulas: A faster approximation scheme for #k-SAT

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a (full) derandomization of HSSW algorithm for 3-SAT, proposed by Hofmeister, Schöning, Schuler, and Watanabe in [STACS'02]. Thereby, we obtain an Õ(1.3303n)-time deterministic algorithm for 3-SAT, which is currently fastest.