Results 1  10
of
44,057
Algorithms for SAT and Upper Bounds on Their Complexity
, 2001
"... We survey recent algorithms for the propositional satisfiability problem, in particular algorithms that have the best current worstcase upper bounds on their complexity. We also discuss some related issues: the derandomization of the algorithm of Paturi, Pudlák, Saks and Zane, the ValiantVazirani ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
We survey recent algorithms for the propositional satisfiability problem, in particular algorithms that have the best current worstcase upper bounds on their complexity. We also discuss some related issues: the derandomization of the algorithm of Paturi, Pudlák, Saks and Zane, the Valiant
ALGORITHMS FOR SAT AND UPPER BOUNDS ON THEIR COMPLEXITY
"... We survey recent algorithms for the propositional satisfiability problem. In particular, we consider algorithms having the best current worstcase upper bounds on their complexity. We also discuss some related issues: a derandomization of the algorithm of Paturi, Pudlák, Saks, and Zane, the Valiant– ..."
Abstract
 Add to MetaCart
We survey recent algorithms for the propositional satisfiability problem. In particular, we consider algorithms having the best current worstcase upper bounds on their complexity. We also discuss some related issues: a derandomization of the algorithm of Paturi, Pudlák, Saks, and Zane, the Valiant
Improved upper bounds for 3sat
 In 15th ACMSIAM Symposium on Discrete Algorithms (SODA 2004). ACM and SIAM
"... The CNF Satisfiability problem is to determine, given a CNF formula F, whether or not there exists a satisfying assignment for F. If each clause of F contains at most k literals, then F is called a kCNF formula and the problem is called kSAT. For small k’s, especially for k = 3, there exists a lot ..."
Abstract

Cited by 48 (3 self)
 Add to MetaCart
lot of algorithms which run significantly faster than the trivial 2n bound. The following list summarizes those algorithms where a constant c means that the algorithm runs in time O(cn). Roughly speaking most algorithms are based on DavisPutnam. [Sch99] is the first local search algorithm which gives
An improved upper bound for SAT
 IN PROCEEDINGS OF THE 8TH INTERNATIONAL CONFERENCE ON THEORY AND APPLICATIONS ON SATISFIABILITY TESTING, SAT 2005
, 2005
"... We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2 n(1−1/α) up to a polynomial factor, where α = ln(m/n) + O(ln ln m) and n, m are respectively the number of variables and the ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
and the number of clauses in the input formula. This bound is asymptotically better than the previously best known 2 n(1−1 / log(2m)) bound for SAT.
Two new upper bounds for SAT
, 1998
"... In 1980 B. Monien and E. Speckenmeyer proved that satisfiability of a propositional formula consisting of K clauses can be checked in time of the order 2^{K/3}. Recently O. Kullmann and H. Luckhardt proved the bound 2^{L/9}, where L is the length of the input formula. The algorithms leading to these ..."
Abstract

Cited by 21 (8 self)
 Add to MetaCart
to these bounds (like many other SAT algorithms) are based on splitting, i.e., they reduce SAT for a formula F to SAT for several simpler formulas F1 , F2 , ... , Fm . These algorithms simplify each of F1 , F2 , ... , Fm according to some transformation rules such as the elimination of pure literals, the unit
New upper bounds for MaxSat
 Charles University, Praha, Faculty of Mathematics and Physics
, 1998
"... We describe exact algorithms that provide new upper bounds for the Maximum Satisfiability problem (MaxSat). We prove that MaxSat can be solved in time O(F  · 1.3972 K), where F  is the length of a formula F in conjunctive normal form and K is the number of clauses in F. We also prove the time b ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
We describe exact algorithms that provide new upper bounds for the Maximum Satisfiability problem (MaxSat). We prove that MaxSat can be solved in time O(F  · 1.3972 K), where F  is the length of a formula F in conjunctive normal form and K is the number of clauses in F. We also prove the time
An Approximation Algorithm for #kSAT
"... We present a simple randomized algorithm that approximates the number of satisfying assignments of Boolean formulas in conjunctive normal form. To the best of our knowledge this is the first algorithm which approximates #kSAT for any k ≥ 3 within a running time that is not only nontrivial, but als ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a simple randomized algorithm that approximates the number of satisfying assignments of Boolean formulas in conjunctive normal form. To the best of our knowledge this is the first algorithm which approximates #kSAT for any k ≥ 3 within a running time that is not only non
An Improved Exponentialtime Algorithm for kSAT
, 1998
"... We propose and analyze a simple new randomized algorithm, called ResolveSat, for finding satisfying assignments of Boolean formulas in conjunctive normal form. The algorithm consists of two stages: a preprocessing stage in which resolution is applied to enlarge the set of clauses of the formula, ..."
Abstract

Cited by 111 (7 self)
 Add to MetaCart
satisfying assignment of a general satisfiable 3CNF in time O(2 :448n ) with high probability; where the best previous algorithm [13] has running time O(2 :562n ). We obtain a better upper bound of 2 (2 ln 2\Gamma1)n+o(n) = O(2 0:387n ) for 3CNF that have exactly one satisfying assignment
Lower Bounds and Upper Bounds for MaxSAT ⋆
"... Abstract. This paper presents several ways to compute lower and upper bounds for MaxSAT based on calling a complete SAT solver. Preliminary results indicate that (i) the bounds are of high quality, (ii) the bounds can boost the search of MaxSAT solvers on some benchmarks, and (iii) the upper bounds ..."
Abstract
 Add to MetaCart
Abstract. This paper presents several ways to compute lower and upper bounds for MaxSAT based on calling a complete SAT solver. Preliminary results indicate that (i) the bounds are of high quality, (ii) the bounds can boost the search of MaxSAT solvers on some benchmarks, and (iii) the upper bounds
Results 1  10
of
44,057