𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The complexity of constraint satisfaction games and QCSP

✍ Scribed by F. Börner; A. Bulatov; H. Chen; P. Jeavons; A. Krokhin

Book ID
113641857
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
482 KB
Volume
207
Category
Article
ISSN
0890-5401

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