QCSP on partially reflexive forests

Martin, Barnaby (2011) QCSP on partially reflexive forests. In: The 17th International Conference on Principles and Practice of Constraint Programming (CP 2011), 12-16 September 2011, Perugia, Italy. (doi:10.1007/978-3-642-23786-7_42)

Full text is not in this repository.

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.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Martin B. (2011) QCSP on Partially Reflexive Forests. In: Lee J. (eds) Principles and Practice of Constraint Programming – CP 2011. CP 2011. Lecture Notes in Computer Science, vol 6876. Springer, Berlin, Heidelberg
Research Areas: A. > School of Science and Technology > Computer Science
A. > School of Science and Technology > Computer Science > Foundations of Computing group
Item ID: 9675
Useful Links:
Depositing User: Devika Mohan
Date Deposited: 16 Jan 2013 08:48
Last Modified: 24 Apr 2018 15:01
ISBN: 9783642237850
URI: https://eprints.mdx.ac.uk/id/eprint/9675

Actions (login required)

Edit Item Edit Item