Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

The complexity of quantified constraints using the algebraic formulation.

Carvalho, Catarina and Martin, Barnaby and Zhuk, Dmitry (2017) 'The complexity of quantified constraints using the algebraic formulation.', in 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) : August 21-25, 2017, Aalborg (Denmark) ; proceedings. Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, p. 27. Leibniz International Proceedings in Informatics (LIPIcs). (83).

Abstract

Let A be an idempotent algebra on a finite domain. We combine results of Chen, Zhuk and Carvalho et al. to argue that if A satisfies the polynomially generated powers property (PGP), then QCSP(Inv(A)) is in NP. We then use the result of Zhuk to prove a converse, that if Inv(A) satisfies the exponentially generated powers property (EGP), then QCSP(Inv(A)) is co-NP-hard. Since Zhuk proved that only PGP and EGP are possible, we derive a full dichotomy for the QCSP, justifying the moral correctness of what we term the Chen Conjecture. We examine in closer detail the situation for domains of size three. Over any finite domain, the only type of PGP that can occur is switchability. Switchability was introduced by Chen as a generalisation of the already-known Collapsibility. For three-element domain algebras A that are Switchable, we prove that for every finite subset Delta of Inv(A), Pol(Delta) is Collapsible. The significance of this is that, for QCSP on finite structures (over three-element domain), all QCSP tractability explained by Switchability is already explained by Collapsibility. Finally, we present a three-element domain complexity classification vignette, using known as well as derived results.

Item Type:Book chapter
Full text:(VoR) Version of Record
Available under License - Creative Commons Attribution.
Download PDF
(528Kb)
Status:Peer-reviewed
Publisher Web site:https://doi.org/10.4230/LIPIcs.MFCS.2017.27
Publisher statement:© Catarina Carvalho, Barnaby Martin, and Dmitriy Zhuk; licensed under Creative Commons License CC-BY
Date accepted:08 September 2017
Date deposited:14 September 2017
Date of first online publication:25 August 2017
Date first made open access:No date available

Save or Share this output

Export:
Export
Look up in GoogleScholar