License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2018.88
URN: urn:nbn:de:0030-drops-90925
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9092/
Liu, Sixue
Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT
Abstract
We present the current fastest deterministic algorithm for k-SAT, improving the upper bound (2-2/k)^{n + o(n)} due to Moser and Scheder in STOC 2011. The algorithm combines a branching algorithm with the derandomized local search, whose analysis relies on a special sequence of clauses called chain, and a generalization of covering code based on linear programming.
We also provide a more intelligent branching algorithm for 3-SAT to establish the upper bound 1.32793^n, improved from 1.3303^n.
BibTeX - Entry
@InProceedings{liu:LIPIcs:2018:9092,
author = {Sixue Liu},
title = {{Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {88:1--88:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-076-7},
ISSN = {1868-8969},
year = {2018},
volume = {107},
editor = {Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'a}niel Marx and Donald Sannella},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9092},
URN = {urn:nbn:de:0030-drops-90925},
doi = {10.4230/LIPIcs.ICALP.2018.88},
annote = {Keywords: Satisfiability, derandomization, local search}
}
|
Keywords: |
|
Satisfiability, derandomization, local search |
|
Collection: |
|
45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
04.07.2018 |
