Searching for authors named "Olivier Dubois" – sorted by Relevance.
7 documents found, showing 1 through 7.
-
Renormalization as a Function of Clause Lengths for Solving Random k-SAT formulae.
- …Introduction In [2] we presented a new branch variable selection heuristic for solving random 3-SAT formulae within a DPL-type procedure. This heuristic relied on the notion of backbone of a SAT formula, a concept recently introduced in a statistical physics study [3]. We now present the generaliza…
- Cited by 2 (0 self) – Add To MetaCart
-
A backbone-search heuristic for efficient solving of hard 3-SAT formulae
- …Of late, new insight into the study of random k-SAT formulae has been gained from the introduction of a concept inspired by models of physics, the `backbone ' of a SAT formula which corresponds to the variables having a fixed truth value in all assignments satisfying the maximum number of claus…
- Cited by 45 (0 self) – Add To MetaCart
-
Additive Decompositions, Random Allocations, and Threshold Phenomena
- …An additive decomposition of a set I of nonnegative integers is an expression of I as the arithmetic sum of two other such sets. If the smaller of these has p elements, we have a p-decomposition. If I is obtained…
- Add To MetaCart
-
Regular random k-sat: Properties of balanced formulas
- …Abstract. We consider a model for generating random k-SAT formulas, in which each literal occurs approximately the same number of times in the formula clauses (regular random k-SAT). Our experimental results show that such regular random k-SAT instances are much harder than the usual uniform random …
- Cited by 4 (1 self) – Add To MetaCart
-
A General Upper Bound for the Satisfiability Threshold of Random
- …It is well known that the general problem of checking the satisfiability of a set of clauses is NP-complete. Experimentations have shown that there is a threshold on the ratio "number of clauses/number of variables" that separates the set of clauses for which a solution can be (easily) found from…
- Add To MetaCart
-
Additive Decompositions, Random Allocations, and Threshold Phenomena.
- …An additive decomposition of a set I of nonnegative integers is an expression of I as the arithmetic sum of two other such sets. If the smaller of these has p elements, we have a p-decomposition.…
- Add To MetaCart
-
Statistical Physics of the Random
- …n abrupt threshold behaviour, separating a SAT phase from an UNSAT one, has indeed been rigourously confirmed for 2-SAT, which is in P, with ff c (2) = 1 [2, 5]. For larger K 3, K-SAT is in NP and much less is known. The existence of a sharp transition has not been proven yet but precise estimates …
- Add To MetaCart
Showing 1 through 7.
