QCSP on partially reflexive forests

Authors:
Barnaby Martin
Affiliations:
School of Engineering and Computing Sciences, Durham University, Science Labs, Durham, UK
Venue:
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Year:
2011

Citing 15
Cited 1

Absolute retracts of bipartite graphs

Discrete Applied Mathematics
Dismantling absolute retracts of reflexive graphs

European Journal of Combinatorics
On the complexity of H-coloring

Journal of Combinatorial Theory Series B
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

SIAM Journal on Computing
The Complexity of the Matching-Cut Problem

WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in 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)
The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case

SIAM Journal on Computing
Majority constraints have bounded pathwidth duality

European Journal of Combinatorics
Quantified Constraints and Containment Problems

LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
The complexity of constraint satisfaction games and QCSP

Information and Computation
The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)

SIAM Journal on Computing
Computing vertex-surjective homomorphisms to partially reflexive trees

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Towards a trichotomy for quantified H-coloring

CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers

Containment, equivalence and coreness from CSP to QCSP and beyond

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the (non-uniform) quantified constraint satisfaction problem QCSP(H) as H ranges over partially reflexive forests. We obtain a complexity-theoretic dichotomy: QCSP(H) is either in NL or is NP-hard. The separating condition is related firstly to connectivity, and thereafter to accessibility from all vertices of H to connected reflexive subgraphs. In the case of partially reflexive paths, we give a refinement of our dichotomy: QCSP(H) is either in NL or is Pspace-complete.