|
ИСТИНА |
Войти в систему Регистрация |
ИПМех РАН |
||
The Complexity of Quantified Constraints Using the Algebraic Formulationстатья
Информация о цитировании статьи получена из
Scopus
Дата последнего поиска статьи во внешних источниках: 2 мая 2018 г.
- Авторы: Catarina Carvalho, Barnaby Martin, Dmitriy Zhuk
- Сборник: 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark
- Серия: Leibniz International Proceedings in Informatics (LIPIcs)
- Том: 83
- Год издания: 2017
- Место издания: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik Dagstuhl, Germany
- Первая страница: 27:1
- Последняя страница: 27:14
- DOI: 10.4230/LIPIcs.MFCS.2017.27
- Аннотация: 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.
- Добавил в систему: Жук Дмитрий Николаевич