License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2017.27
URN: urn:nbn:de:0030-drops-80793
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/8079/
Go to the corresponding LIPIcs Volume Portal

Carvalho, Catarina ; Martin, Barnaby ; Zhuk, Dmitriy

The Complexity of Quantified Constraints Using the Algebraic Formulation

pdf-format:
LIPIcs-MFCS-2017-27.pdf (0.5 MB)

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.

BibTeX - Entry

@InProceedings{carvalho_et_al:LIPIcs:2017:8079,
  author =	{Catarina Carvalho and Barnaby Martin and Dmitriy Zhuk},
  title =	{{The Complexity of Quantified Constraints Using the Algebraic Formulation}},
  booktitle =	{42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
  pages =	{27:1--27:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-046-0},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{83},
  editor =	{Kim G. Larsen and Hans L. Bodlaender and Jean-Francois Raskin},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/8079},
  URN =		{urn:nbn:de:0030-drops-80793},
  doi =		{10.4230/LIPIcs.MFCS.2017.27},
  annote =	{Keywords: Quantified Constraints, Computational Complexity, Universal Algebra, Constraint Satisfaction}
}

Keywords: Quantified Constraints, Computational Complexity, Universal Algebra, Constraint Satisfaction
Collection: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
Issue Date: 2017
Date of publication: 01.12.2017

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI