New Algorithms for k -SAT Based on the Local Search Principle

Authors:
Uwe Schöning
Affiliations:
-
Venue:
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Year:
2001

Citing 8
Cited 1

On selecting a satisfying truth assignment (extended abstract)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
New methods for 3-SAT decision and worst-case analysis

Theoretical Computer Science
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search

Theoretical 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
Solving satisfiability in less than 2n steps

Discrete Applied Mathematics

Parametric quantified SAT solving

Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, several algorithms for the NP-complete problem k- SAT have been proposed and rigorously analyzed. These algorithms are based on the heuristic principle of local search. Their deterministic and their probabilistic versions and variations, have been shown to achieve the best complexity bounds that are known for k-SAT (or the special case 3-SAT). We review these algorithms, their underlying principles and their analyses.