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.2016.32
URN: urn:nbn:de:0030-drops-64461
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6446/
Go to the corresponding LIPIcs Volume Portal

Dose, Titus

Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers

pdf-format:
LIPIcs-MFCS-2016-32.pdf (0.5 MB)

Abstract

We study the computational complexity of constraint satisfaction problems that are based on integer expressions and algebraic circuits. On input of a finite set of variables and a finite set of constraints the question is whether the variables can be mapped onto finite subsets of N (resp., finite intervals over N) such that all constraints are satisfied. According to the operations allowed in the constraints, the complexity varies over a wide range of complexity classes such as L, P, NP, PSPACE, NEXP, and even Sigma_1, the class of c.e. languages.

BibTeX - Entry

@InProceedings{dose:LIPIcs:2016:6446,
  author =	{Titus Dose},
  title =	{{Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers}},
  booktitle =	{41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)},
  pages =	{32:1--32:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-016-3},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{58},
  editor =	{Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6446},
  URN =		{urn:nbn:de:0030-drops-64461},
  doi =		{10.4230/LIPIcs.MFCS.2016.32},
  annote =	{Keywords: computational complexity, constraint satisfaction problems, integer expressions and circuits}
}

Keywords: computational complexity, constraint satisfaction problems, integer expressions and circuits
Collection: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Issue Date: 2016
Date of publication: 19.08.2016

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