License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/DFU.Vol7.15301.327
URN: urn:nbn:de:0030-drops-69699
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/6969/
Martin, Barnaby
Quantified Constraints in Twenty Seventeen
Abstract
I present a survey of recent advances in the algorithmic and computational complexity theory of non-Boolean Quantified Constraint Satisfaction Problems, incorporating some more modern research directions.
BibTeX - Entry
@InCollection{martin:DFU:2017:6969,
author = {Barnaby Martin},
title = {{Quantified Constraints in Twenty Seventeen}},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
pages = {327--346},
series = {Dagstuhl Follow-Ups},
ISBN = {978-3-95977-003-3},
ISSN = {1868-8977},
year = {2017},
volume = {7},
editor = {Andrei Krokhin and Stanislav Zivny},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/6969},
URN = {urn:nbn:de:0030-drops-69699},
doi = {10.4230/DFU.Vol7.15301.327},
annote = {Keywords: Quantified constraints, Constraint satisfaction problems, Computational complexity, Parameterized complexity, Universal algebra}
}
Keywords: |
|
Quantified constraints, Constraint satisfaction problems, Computational complexity, Parameterized complexity, Universal algebra |
Collection: |
|
The Constraint Satisfaction Problem: Complexity and Approximability |
Issue Date: |
|
2017 |
Date of publication: |
|
21.02.2017 |