Coarse and Sharp Thresholds of Boolean Constraint Satisfaction Problems
نویسنده
چکیده
We study threshold properties of random constraint satisfaction problems under a probabilistic model due to Molloy [11]. We give a sufficient condition for the existence of a sharp threshold that leads (for boolean constraints) to a necessary and sufficient for the existence of a sharp threshold in the case where constraint templates are applied with equal probability, solving thus an open problem from [3].
منابع مشابه
ar X iv : c s . D M / 0 50 30 83 v 1 2 9 M ar 2 00 5 Coarse and Sharp Thresholds of Boolean Constraint Satisfaction Problems ∗
We study threshold properties of random constraint satisfaction problems under a probabilistic model due to Molloy [11]. We give a sufficient condition for the existence of a sharp threshold that leads (for boolean constraints) to a necessary and sufficient for the existence of a sharp threshold in the case where constraint templates are applied with equal probability, solving thus an open prob...
متن کاملSharp thresholds for constraint satisfaction problems and homomorphisms
We determine under which conditions certain natural models of random constraint satisfaction problems have sharp thresholds of satisfiability. These models include graph and hypergraph homomorphism, the (d, k, t)-model, and binary constraint satisfaction problems with domain size 3.
متن کاملRandom generalized satisfiability problems
We develop a coherent model in order to study specific random constraint satisfaction problems. Our framework includes all the generalized satisfiability problems defined by Schaefer. For such problems we study the phase transition. Our model captures problems having a sharp transition as well as problems having a coarse transition. We first give lower and upper bounds for the location of the p...
متن کاملThe Complexity of Symmetric Boolean Parity Holant Problems
For certain subclasses of NP, ⊕P or #P characterized by local constraints, it is known that if there exist any problems that are not polynomial time computable within that subclass, then those problems are NP-, ⊕Por #P-complete. Such dichotomy results have been proved for characterizations such as Constraint Satisfaction Problems, and directed and undirected Graph Homomorphism Problems, often w...
متن کاملLearning to Identify Global Bottlenecks in Constraint Satisfaction Search
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constraint satisfaction problems (CSPs). The information learnt can take various forms such as fine-grained information in the form of no-goods and explanations in CSPs and clause learning in SAT, or coarse-grained informatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0503083 شماره
صفحات -
تاریخ انتشار 2005