Closure properties of constraints
Journal of the ACM (JACM)
On the algebraic structure of combinatorial problems
Theoretical Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
Constraint Satisfaction with Countable Homogeneous Templates
Journal of Logic and Computation
MAX ONES Generalized to Larger Domains
SIAM Journal on Computing
The Complexity of the Counting Constraint Satisfaction Problem
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Existentially restricted quantified constraint satisfaction
Information and Computation
Universal algebra and hardness results for constraint satisfaction problems
Theoretical Computer Science
A rendezvous of logic, complexity, and algebra
ACM Computing Surveys (CSUR)
The complexity of constraint satisfaction games and QCSP
Information and Computation
Constraints, consistency and closure
Artificial Intelligence
The complexity of temporal constraint satisfaction problems
Journal of the ACM (JACM)
Constraint Satisfaction Problems of Bounded Width
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Tractability and Learnability Arising from Algebras with Few Subpowers
SIAM Journal on Computing
Generic expression hardness results for primitive positive formula comparison
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
An algebraic theory of complexity for valued constraints: establishing a Galois connection
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Quantified Equality Constraints
SIAM Journal on Computing
Towards a trichotomy for quantified H-coloring
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Quantified constraint satisfaction, maximal constraint languages, and symmetric polymorphisms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
The quantified constraint satisfaction problem (QCSP) is the problem of deciding, given a structure and a first-order prenex sentence whose quantifier-free part is the conjunction of atoms, whether or not the sentence holds on the structure. One obtains a family of problems by defining, for each structure B , the problem QCSP(B ) to be the QCSP where the structure is fixed to be B . In this article, we offer a viewpoint on the research program of understanding the complexity of the problems QCSP(B ) on finite structures. In particular, we propose and discuss a group of conjectures; throughout, we attempt to place the conjectures in relation to existing results and to emphasize open issues and potential research directions.