A shorter model theory
Closure properties of constraints
Journal of the ACM (JACM)
On the algebraic structure of combinatorial problems
Theoretical Computer Science
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
Tractable conservative Constraint Satisfaction Problems
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
A Simple Algorithm for Mal'tsev Constraints
SIAM Journal on Computing
On Tractability and Congruence Distributivity
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Constraint Satisfaction with Countable Homogeneous Templates
Journal of Logic and Computation
Tractability and learnability arising from algebras with few subpowers
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
The Complexity of Equality Constraint Languages
Theory of Computing Systems
Positive first-order logic is NP-complete
IBM Journal of Research and Development
Constraint Satisfaction Problems of Bounded Width
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Collapsibility in infinite-domain quantified constraint satisfaction
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Meditations on quantified constraint satisfaction
Logic and Program Semantics
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Syntactically characterizing local-to-global consistency in ORD-Horn
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
An equality template is a relational structure with infinite universe whose relations can be defined by Boolean combinations of equalities. We prove a complexity classification for quantified constraint satisfaction problems (QCSPs) over equality templates: These problems are in L (decidable in logarithmic space), NP-hard, or coNP-hard. To establish our classification theorem we combine methods from universal algebra with concepts from model theory.