Derandomization of PPSZ for unique-k-SAT

Authors:
Daniel Rolf
Affiliations:
Institut für Informatik, Lehrstuhl für Logik in der Informatik, Humboldt-Universität zu Berlin, Berlin, Germany
Venue:
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Year:
2005

Citing 7
Cited 3

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 exponential-time algorithm for k-SAT

Journal of the ACM (JACM)

On quantum versions of record-breaking algorithms for SAT

ACM SIGACT News
Quantum versions of k-CSP algorithms: a first step towards quantum algorithms for interval-related constraint satisfaction problems

Proceedings of the 2006 ACM symposium on Applied computing
A full derandomization of schöning's k-SAT algorithm

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

Quantified Score

Hi-index	0.01

Visualization

Abstract

The PPSZ Algorithm presented by Paturi, Pudlak, Saks, and Zane in 1998 has the nice feature that the only satisfying solution of a uniquely satisfiable 3-SAT formula can be found in expected running time at most $\mathcal{O}(1.3071^n)$. Using the technique of limited independence, we can derandomize this algorithm yielding $\mathcal{O}(1.3071^n)$ deterministic running time at most.