115
click to vote
CSL
2006
Springer
15 years 6 months ago
2006
Springer
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...