✦ LIBER ✦

The complexity of soft constraint satisfaction

✍ Scribed by David A. Cohen; Martin C. Cooper; Peter G. Jeavons; Andrei A. Krokhin

Book ID: 118418562
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 407 KB
Volume: 170
Category: Article
ISSN: 0004-3702
DOI: 10.1016/j.artint.2006.04.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The complexity of recursive constraint s

The complexity of recursive constraint satisfaction problems

✍ Victor W. Marek; Jeffrey B. Remmel 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 701 KB

Parameterized complexity of constraint s

Parameterized complexity of constraint satisfaction problems

✍ Dániel Marx 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 285 KB

Constraint satisfaction using soft quant

Constraint satisfaction using soft quantifiers

✍ Ronald R. Yager 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 78 KB

Constraint satisfaction — Algorithms and

Constraint satisfaction — Algorithms and complexity analysis

✍ Walter Hower 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 676 KB

The complexity of constraint satisfactio

The complexity of constraint satisfaction games and QCSP

✍ F. Börner; A. Bulatov; H. Chen; P. Jeavons; A. Krokhin 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 482 KB