Π P 2 vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F24%3A10489632" target="_blank" >RIV/00216208:11320/24:10489632 - isvavai.cz</a>
Result on the web
<a href="https://arxiv.org/abs/2404.03844" target="_blank" >https://arxiv.org/abs/2404.03844</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/FOCS61266.2024.00043" target="_blank" >10.1109/FOCS61266.2024.00043</a>

Result language
angličtina
Original language name
Π P 2 vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem
Original language description
The Quantified Constraint Satisfaction Problem is the problem of evaluating a sentence with both quantifiers, over relations from some constraint language, with conjunction as the only connective. We show that for any constraint language on a finite domain the Quantified Constraint Satisfaction Problem is either in ΠP 2 , or PSpace-complete. Additionally, we build a constraint language on a 6-element domain such that the QuantifiedConstraint Satisfaction Problem over this language is ΠP 2 -complete.
Czech name
—
Czech description
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)
ISBN
—
ISSN
1523-8288
e-ISSN
2575-8454
Number of pages
45
Pages from-to
2-46
Publisher name
IEEE
Place of publication
New York, NY
Event location
Chicago, USA
Event date
Oct 27, 2024
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)