Improved Randomized Algorithms for 3-SAT

Derandomizing the HSSW Algorithm for 3-SAT

“…As long as the authors know, it is the currently fastest deterministic algorithm for 3-SAT. Our result seems to be a necessary step towards a full derandomization of the currently best known randomized algorithm, since it is based on the combination of two algorithms [9] and [7], which are respectively a modification of Hofmeister et al's algorithm [8] and an extension of Paturi et al's algorithm [15].…”

Derandomizing HSSW Algorithm for 3-SAT

“…Our result seems to be a necessary step towards a full derandomization of the currently best known randomized algorithm, since it is based on the combination of two algorithms [9] and [7], which are respectively a modification of Hofmeister et al's algorithm [8] and an extension of Paturi et al's algorithm [15].…”

Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth

“…A considerable amount of research has gone into devising improved algorithms for checking the satisfiability of various circuit models up to depth o(log n/ log log n) (see, for example, [26,35,30,29,36,5,21,27,18,40,19,6,20,9,25]), although the question of improved algorithms for checking the satisfiability of linear size bounded depth threshold circuits is still unresolved. The improvements range from superpolynomial factors to exponential factors depending on the circuit model, size and depth.…”