Results 1  10
of
60
Finding Hard Instances of the Satisfiability Problem: A Survey
, 1997
"... . Finding sets of hard instances of propositional satisfiability is of interest for understanding the complexity of SAT, and for experimentally evaluating SAT algorithms. In discussing this we consider the performance of the most popular SAT algorithms on random problems, the theory of average case ..."
Abstract

Cited by 128 (1 self)
 Add to MetaCart
. Finding sets of hard instances of propositional satisfiability is of interest for understanding the complexity of SAT, and for experimentally evaluating SAT algorithms. In discussing this we consider the performance of the most popular SAT algorithms on random problems, the theory of average case complexity, the threshold phenomenon, known lower bounds for certain classes of algorithms, and the problem of generating hard instances with solutions.
Typical random 3SAT formulae and the satisfiability threshold
 in Proceedings of the Eleventh ACMSIAM Symposium on Discrete Algorithms
, 2000
"... Abstract: We present a new structural (or syntactic) approach for estimating the satisfiability threshold of random 3SAT formulae. We show its efficiency in obtaining a jump from the previous upper bounds, lowering them to 4.506. The method combines well with other techniques, and also applies to o ..."
Abstract

Cited by 96 (3 self)
 Add to MetaCart
(Show Context)
Abstract: We present a new structural (or syntactic) approach for estimating the satisfiability threshold of random 3SAT formulae. We show its efficiency in obtaining a jump from the previous upper bounds, lowering them to 4.506. The method combines well with other techniques, and also applies to other problems, such as the 3colourability of random graphs. 1
Approximating the unsatisfiability threshold of random formulas
, 1998
"... ABSTRACT: Let � be a random Boolean formula that is an instance of 3SAT. We consider the problem of computing the least real number � such that if the ratio of the number of clauses over the number of variables of � strictly exceeds �, then � is almost certainly unsatisfiable. By a wellknown and m ..."
Abstract

Cited by 85 (14 self)
 Add to MetaCart
ABSTRACT: Let � be a random Boolean formula that is an instance of 3SAT. We consider the problem of computing the least real number � such that if the ratio of the number of clauses over the number of variables of � strictly exceeds �, then � is almost certainly unsatisfiable. By a wellknown and more or less straightforward argument, it can be shown that ��5.191. This upper bound was improved by Kamath et al. to 4.758 by first providing new improved bounds for the occupancy problem. There is strong experimental evidence that the value of � is around 4.2. In this work, we define, in terms of the random formula �, a decreasing sequence of random variables such that, if the expected value of any one of them converges to zero, then � is almost certainly unsatisfiable. By letting the expected value of the first term of the sequence converge to zero, we obtain, by simple and elementary computations, an upper bound for � equal to 4.667. From the expected value of the second term of the sequence, we get the value 4.601�. In general, by letting the
Random Constraint Satisfaction: A More Accurate Picture
, 1997
"... Recently there has been a great amount of interest in Random Constraint Satisfaction Problems, both from an experimental and a theoretical point of view. Rather intruigingly, experimental results with various models for generating random CSP instances suggest a "thresholdlike" behaviou ..."
Abstract

Cited by 83 (7 self)
 Add to MetaCart
Recently there has been a great amount of interest in Random Constraint Satisfaction Problems, both from an experimental and a theoretical point of view. Rather intruigingly, experimental results with various models for generating random CSP instances suggest a "thresholdlike" behaviour and some theoretical work has been done in analyzing these models when the number of variables is asymptotic. In this paper we show that the models commonly used for generating random CSP instances suffer from a wrong parameterization which makes them unsuitable for asymptotic analysis. In particular, when the number of variables becomes large almost all instances they generate are, trivially, overconstrained. We then present a new model that is suitable for asymptotic analysis and, in the spirit of random SAT, we derive lower and upper bounds for its parameters so that the instances generated are "almost surely" over and underconstrained, respectively. Finally, we apply the technique introduced in [19], to one of the popular models in Artificial Intelligence and derive sharper estimates for the probability of being overconstrained as a function of the number of variables. 1
The Probabilistic Analysis of a Greedy Satisfiability Algorithm
, 2002
"... Consider the following simple, greedy DavisPutnam algorithm applied to a random 3CNF formula of fixed density (clauses to variables ratio): Arbitrarily select and set to True a literal that appears in as many clauses as possible, irrespective of their size (and irrespective of the number of occu ..."
Abstract

Cited by 74 (5 self)
 Add to MetaCart
(Show Context)
Consider the following simple, greedy DavisPutnam algorithm applied to a random 3CNF formula of fixed density (clauses to variables ratio): Arbitrarily select and set to True a literal that appears in as many clauses as possible, irrespective of their size (and irrespective of the number of occurrences of the negation of the literal). Delete these clauses from the formula, and also delete the negation of this literal from any clauses it appears. Repeat. If however unit clauses ever appear, then first repeatedly and in any order set the literals in them to True and delete and shrink clauses accordingly, until no unit clause remains. Also if at any step an empty clause appears, then do not backtrack, but just terminate the algorithm and report failure. A slight modification of this algorithm is probabilistically analyzed in this paper (rigorously). It is proved that for random formulas of n variables and density up to 3.42, it succeeds in producing a satisfying truth assignment with bounded away from zero probability, as n approaches infinity. Therefore the satisfiability threshold is at least 3.42.
On the solutionspace geometry of random constraint satisfaction problems
 In STOC ’06: Proceedings of the thirtyeighth annual ACM symposium on Theory of computing
, 2006
"... For a large number of random constraint satisfaction problems, such as random kSAT and random graph and hypergraph coloring, there are very good estimates of the largest constraint density for which solutions exist. Yet, all known polynomialtime algorithms for these problems fail to find solutions ..."
Abstract

Cited by 59 (2 self)
 Add to MetaCart
(Show Context)
For a large number of random constraint satisfaction problems, such as random kSAT and random graph and hypergraph coloring, there are very good estimates of the largest constraint density for which solutions exist. Yet, all known polynomialtime algorithms for these problems fail to find solutions even at much lower densities. To understand the origin of this gap we study how the structure of the space of solutions evolves in such problems as constraints are added. In particular, we prove that much before solutions disappear, they organize into an exponential number of clusters, each of which is relatively small and far apart from all other clusters. Moreover, inside each cluster most variables are frozen, i.e., take only one value. The existence of such frozen variables gives a satisfying intuitive explanation for the failure of the polynomialtime algorithms analyzed so far. At the same time, our results establish rigorously one of the two main hypotheses underlying Survey Propagation, a heuristic introduced by physicists in recent years that appears to perform extraordinarily well on random constraint satisfaction problems. 1
2+p SAT: Relation of typicalcase complexity to the nature of the phase transition. Random Structures and Algorithms
, 1999
"... ABSTRACT: Heuristic methods for solution of problems in the NPcomplete class of decision problems often reach exact solutions, but fail badly at ‘‘phase boundaries,’ ’ across which the decision to be reached changes from almost always having one value to almost always having a different value. We r ..."
Abstract

Cited by 57 (2 self)
 Add to MetaCart
ABSTRACT: Heuristic methods for solution of problems in the NPcomplete class of decision problems often reach exact solutions, but fail badly at ‘‘phase boundaries,’ ’ across which the decision to be reached changes from almost always having one value to almost always having a different value. We report an analytic solution and experimental investigations of the phase transition that occurs in the limit of very large problems in KSAT. Studying a model which interpolates KSAT between K�2 and K�3, we find a change from a continuous to a discontinuous phase transition when K, the average number of inputs per clause, exceeds 0.4. The cost of finding solutions also increases dramatically above this changeover. The nature of its ‘‘random firstorder’ ’ phase transition, seen at values of K large enough to make the computational cost of solving typical instances increase exponentially with problem size, suggests a mechanism for the cost increase. There has been
Threshold values of random kSAT from the cavity method
 Rand. Struct. Alg
, 2006
"... ..."
(Show Context)
Setting 2 variables at a time yields a new lower bound for random 3SAT (Extended Abstract)
 STOC
, 2000
"... Let X be a set of n Boolean variables and denote by C(X) the set of all 3clauses over X, i.e. the set of all 8(3) possible disjunctions of three distinct, noncomplementary literais from variables in X. Let F(n, m) be a random 3SAT formula formed by selecting, with replacement, m clauses uniformly ..."
Abstract

Cited by 38 (5 self)
 Add to MetaCart
Let X be a set of n Boolean variables and denote by C(X) the set of all 3clauses over X, i.e. the set of all 8(3) possible disjunctions of three distinct, noncomplementary literais from variables in X. Let F(n, m) be a random 3SAT formula formed by selecting, with replacement, m clauses uniformly at random from C(X) and taking their conjunction. The satisfiability threshold conjecture asserts that there exists a constant ra such that as n+ c¢, F(n, rn) is satisfiable with probability that tends to 1 if r < ra, but unsatisfiable with probability that tends to 1 if r:> r3. Experimental evidence suggests rz ~ 4.2. We prove rz> 3.145 improving over the previous best lower bound r3> 3.003 due to Frieze and Suen. For this, we introduce a satisfiability heuristic that works iteratively, permanently setting the value of a pair of variables in each round. The framework we develop for the analysis of our heuristic allows us to also derive most previous lower bounds for random 3SAT in a uniform manner and with little effort.
Random kSAT: two moments suffice to cross a sharp threshold
 CoRR
, 2006
"... Abstract. Many NPcomplete constraint satisfaction problems appear to undergo a “phase transition” from solubility to insolubility when the constraint density passes through a critical threshold. In all such cases it is easy to derive upper bounds on the location of the threshold by showing that abo ..."
Abstract

Cited by 36 (4 self)
 Add to MetaCart
(Show Context)
Abstract. Many NPcomplete constraint satisfaction problems appear to undergo a “phase transition” from solubility to insolubility when the constraint density passes through a critical threshold. In all such cases it is easy to derive upper bounds on the location of the threshold by showing that above a certain density the first moment (expectation) of the number of solutions tends to zero. We show that in the case of certain symmetric constraints, considering the second moment of the number of solutions yields nearly matching lower bounds for the location of the threshold. Specifically, we prove that the threshold for both random hypergraph 2colorability (Property B) and random NotAllEqual kSAT is 2 k−1 ln 2 − O(1). As a corollary, we establish that the threshold for random kSAT is of order Θ(2 k), resolving a longstanding open problem.