We study the satisfiability of randomly generated formulas formed by M clauses of exactly K
literals over N Boolean variables. For a given value of N the problem is known to be most …

Finding sets of hard instances of propositional satis ability is of interest for understanding the
complexity of SAT, and for experimentally evaluating SAT algorithms. In discussing this we …

Let ϕ be a random Boolean formula that is an instance of 3-SAT. We consider the problem of
computing the least real number κ such that if the ratio of the number of clauses over the …

On input a random 3‐CNF formula of clauses‐to‐variables ratio r3 applies repeatedly the
following simple heuristic: Set to True a literal that appears in the maximum number of …

The satisfiability threshold conjecture states that for a randomly generated formula of m
clauses of exactly k literals over n variables, the probability that it is satisfiable, as n tends to …

Consider a randomly generated boolean formula F (in the conjunctive normal form) with m
clauses of size k over n variables; k is fixed at any value greater than 1, but n tends to infinity …

We consider the performance of two algorithms, GUC and SC studied by MT Chao and J.
Franco [SIAM J. Comput. 15 (1986), 1106–1118; Inform. Sci. 51 (1990), 289–314] and V …

We consider the random 2‐satisfiability (2‐SAT) problem, in which each instance is a
formula that is the conjunction of m clauses of the form x∨ y, chosen uniformly at random …

We report results from large-scale experiments in satisfiability testing. As has been observed
by others, testing the satisfiability of random formulas often appears surprisingly easy. Here …

This paper shows that a minimization version of satisfiability is strongly NP-hard, even if
each clause contains no more than two literals and/or each clause contains at most one …