Π_{2}^{P} 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%2F25%3A10509193" target="_blank" >RIV/00216208:11320/25:10509193 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=DvuqyH_geN" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=DvuqyH_geN</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1137/25M1725747" target="_blank" >10.1137/25M1725747</a>

Result language
angličtina
Original language name
Π_{2}^{P} 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 the conjunction as the only connective. We show that for any constraint language on a finite domain, the quantified constraint satisfaction problem is either in Pi P 2 or PSpace-complete. Additionally, we build a constraint language on a 6-element domain such that the quantified constraint satisfaction problem over this language isPi P 2-complete.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

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

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

Similar results(10)