✦ LIBER ✦

Low-level dichotomy for quantified constraint satisfaction problems

✍ Scribed by Barnaby Martin

Book ID: 108154786
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 159 KB
Volume: 111
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2011.07.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Towards a dichotomy theorem for the coun

Towards a dichotomy theorem for the counting constraint satisfaction problem

✍ Andrei A. Bulatov; Víctor Dalmau 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 411 KB

Full Constraint Satisfaction Problems

✍ Feder, Tomás; Hell, Pavol 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 225 KB

DEPICT: A high-level formal language for

DEPICT: A high-level formal language for modeling constraint satisfaction problems

✍ Abdulwahed M. Abbas; Edward P. K. Tsang; Ahmad H. Nasri 📂 Article 📅 2008 🏛 Institute of Automation, Chinese Academy of Scienc 🌐 English ⚖ 234 KB

Solution Techniques for Constraint Satis

Solution Techniques for Constraint Satisfaction Problems: Foundations

✍ I. Miguel; Q. Shen 📂 Article 📅 2001 🏛 Springer Netherlands 🌐 English ⚖ 212 KB

Backjump-based backtracking for constrai

Backjump-based backtracking for constraint satisfaction problems

✍ Rina Dechter; Daniel Frost 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 385 KB

The performance of backtracking algorithms for solving finite-domain constraint satisfaction problems can be improved substantially by look-back and look-ahead methods. Look-back techniques extract information by analyzing failing search paths that are terminated by dead-ends. Look-ahead techniques