A Full Derandomization of Schoening's k-SAT Algorithm

A Full Derandomization of Schoening's k-SAT Algorithm

Schoening in 1999 presented a simple randomized algorithm for k-SAT with running time O(a^n * poly(n)) for a = 2(k-1)/k. We give a deterministic version of this algorithm running in time O((a+epsilon)^n * poly(n)), where epsilon > 0 can be made arbitrarily small.

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Moser, Robin A, Scheder, Dominik
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Data Structures and Algorithms
Computer Science - Discrete Mathematics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Schoening in 1999 presented a simple randomized algorithm for k-SAT with running time O(a^n * poly(n)) for a = 2(k-1)/k. We give a deterministic version of this algorithm running in time O((a+epsilon)^n * poly(n)), where epsilon > 0 can be made arbitrarily small.
DOI:10.48550/arxiv.1008.4067