✦ LIBER ✦

The SAT–UNSAT transition for random constraint satisfaction problems

✍ Scribed by Nadia Creignou; Hervé Daudé

Book ID: 108114029
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 851 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.04.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear phase transition in random linear

Linear phase transition in random linear constraint satisfaction problems

✍ David Gamarnik 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 280 KB

Random Subcubes as a Toy Model for Const

Random Subcubes as a Toy Model for Constraint Satisfaction Problems

✍ Thierry Mora; Lenka Zdeborová 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 555 KB

On the Freezing of Variables in Random C

On the Freezing of Variables in Random Constraint Satisfaction Problems

✍ Guilhem Semerjian 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 846 KB

Resolution Complexity of Random Constrai

Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story

✍ Yong Gao; Joseph Culberson 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 97 KB

Let C 2,k,t n,cn be a random constraint satisfaction problem(CSP) of n binary variables, where c > 0 is a fixed constant and the cn constraints are selected uniformly and independently from all the possible k-ary constraints each of which contains exactly t tuples of the values as its restrictions.

The property of being polynomial for Mal

The property of being polynomial for Mal’tsev constraint satisfaction problems

✍ A. A. Bulatov 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 318 KB

The complexity of some polynomial networ

The complexity of some polynomial network consistency algorithms for constraint satisfaction problems

✍ Alan K. Mackworth; Eugene C. Freuder 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 475 KB