Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
نویسندگان
چکیده
منابع مشابه
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
This paper discusses a model of constraint satisfaction problems known as uniquely extendible constraint satisfaction problems. This model includes and generalizes XOR-SAT, and the model includes an NP-complete problem that appears to share many of the threshold characteristics of random SAT. In this paper we find an exact threshold in the behavior of two versions of DPLL on random instances of...
متن کاملOn SAT Representations of XOR Constraints
We study the problem of finding good CNF-representations F of systems of linear equations S over the two-element field, also known as systems of XORconstraints x1 ⊕ · · · ⊕ xk = ε, ε ∈ {0, 1}, or systems of parity-constraints. The number of equations in S is m, the number of variables is n. These representations are used as parts of SAT problems F ∗ ⊃ F , such that F has “good” properties for S...
متن کاملThe Interface between P and NP: COL, XOR, NAE, 1-in- , and Horn SAT
We study in detail the interface between P and NP by means of five new problem classes. Like the well known 2+ -SAT problem, these new problems smoothly interpolate between P and NP by mixing together a polynomial and a NP-complete problem. In many cases, the polynomial subproblem can dominate the problem’s satisfiability and the search complexity. However, this is not always the case, and unde...
متن کاملXOR Satisfiability Solver Module for DPLL Integration
Satisfiability solvers that are based on the Davis-Putnam-Logemann-Loveland (DPLL) algorithm operate on propositional logic formulas in conjunctive normal form (CNF). Despite major improvements in solver technology, using only CNF does not seem to scale well for problem instances involving XOR expressions. We present a decision procedure to determine effectively the satisfiability of XOR clause...
متن کاملSolving MAX-XOR-SAT Problems with Stochastic Local Search
The MAX-SAT problem is to find a truth assignment that satisfies the maximum number of clauses in a finite set of logical clauses. In the special case of MAX-XOR-SAT, arising from Linear Cryptanalysis, each clause is a set of literals joined by exclusive-or (xor). Solving MAX-XOR-SAT is useful in finding keys to decrypt intercepted encrypted messages. This report presents and evaluates Xor-Walk...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.11.014