We prove the worst-case upper bound 1.5045.. n for the time complexity of 3-SAT decision,
where n is the number of variables in the input formula, introducing new methods for the …

The k-SAT problem is to determine if a given k-CNF has a satisfying assignment. It is a
celebrated open question as to whether it requires exponential time to solve k-SAT for k⩾ 3 …

For several NP-complete problems, there have been a progression of better but still
exponential algorithms. In this paper, we address the relative likelihood of sub-exponential …

Local search is widely used for solving the propositional satisfiability problem. Papadimitriou
(1991) showed that randomized local search solves 2-SAT in polynomial time. Recently …

Motivated by improved SAT algorithms ((O. Kullmann, DIMACS Series, vol. 35, Amer. Math.
Soc., Providence, RI, 1997; O. Kullmann, Theoret. Comput. Sci.(1999); O. Kullmann, Inform …

The topic of exact, exponential-time algorithms for NP-hard problems has received a lot of
attention, particularly with the focus of producing algorithms with stronger theoretical …

Abstract In 1980 Monien and Speckenmeyer proved that satisfiability of a propositional
formula consisting of K clauses (of arbitrary length) can be checked in time of the order 2 …

The (unweighted) Maximum Satisfiability problem (MaxSat) is: Given a Boolean formula in
conjunctive normal form, find a truth assignment that satisfies the largest number of clauses …

The chapter is a survey of ideas and techniques behind satisfiability algorithms with the
currently best asymptotic upper bounds on the worst-case running time. The survey also …

Abstract “Search trees”,“branching trees”,“backtracking trees” or “enumeration trees” are at
the heart of many (complete) approaches towards hard combinatorial problems, constraint …