✦ LIBER ✦

Parameterized complexity of constraint satisfaction problems

✍ Scribed by Dániel Marx

Publisher: Springer
Year: 2005
Tongue: English
Weight: 285 KB
Volume: 14
Category: Article
ISSN: 1016-3328
DOI: 10.1007/s00037-005-0195-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Complexity of Boolean Constraint Sat

The Complexity of Boolean Constraint Satisfaction Local Search Problems

✍ Philippe Chapdelaine; Nadia Creignou 📂 Article 📅 2005 🏛 Springer Netherlands 🌐 English ⚖ 124 KB

The complexity of Boolean constraint sat

The complexity of Boolean constraint satisfaction local search problems

✍ Philippe Chapdelaine; Nadia Creignou 📂 Article 📅 2004 🏛 Springer Netherlands 🌐 English ⚖ 129 KB

Complexity and Approximability of Quanti

Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction Problems

✍ Harry B. Hunt III; Madhav V. Marathe; Richard E. Stearns 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 913 KB

The complexity of constraint satisfactio

The complexity of constraint satisfaction revisited

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

Mackworth, A.K. and E.C. Freuder, The complexity of constraint satisfaction revisited, Artificial Intelligence 59 (1993) 57-62. This paper is a retrospective account of some of the developments leading up to, and ensuing from, the analysis of the complexity of some polynomial network consistency alg

Constraint satisfaction — Algorithms and

Constraint satisfaction — Algorithms and complexity analysis

✍ Walter Hower 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 676 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.