ω-categorical CSPs are complete for every level of the Polynomial Hierarchy.
When symmetries are not enough: A hierarchy of hard constraint satisfaction problems.SIAM J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Polynomial Hierarchy and $\omega$-categorical CSPs
ω-categorical CSPs are complete for every level of the Polynomial Hierarchy.