Proves PSPACE-completeness of QCSP(N; x=y→y=z) to complete the Logspace/NP-complete/PSpace-complete trichotomy for QCSPs over equality languages, plus classification for bounded alternation versions.
Existentially restricted quantified constraint satisfact ion
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2021 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The complete classification for quantified equality constraints
Proves PSPACE-completeness of QCSP(N; x=y→y=z) to complete the Logspace/NP-complete/PSpace-complete trichotomy for QCSPs over equality languages, plus classification for bounded alternation versions.