Quantified Constraint Satisfaction Problems: Closure Properties, Complexity, and Algorithms


There has been much prior work on understanding the complexity of the constraint satisfaction problem (CSP), a broad framework capturing many combinatorial problems. This paper studies the complexity of the quantified constraint satisfaction problem (QCSP), a natural and strict generalization of the CSP. The CSP can be viewed as the problem of deciding… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics