QCSP on partially reflexive forests
Computational Complexity
2011-04-01 v1
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.
Cite
@article{arxiv.1103.6212,
title = {QCSP on partially reflexive forests},
author = {Barnaby Martin},
journal= {arXiv preprint arXiv:1103.6212},
year = {2011}
}