QCSP on partially reflexive cycles - the wavy line of tractability
classification
💻 cs.CC
keywords
qcspcycleslinepartiallyreflexivetractabilitywavycomplexity-theoretic
read the original abstract
We study the (non-uniform) quantified constraint satisfaction problem QCSP(H) as H ranges over partially reflexive cycles. We obtain a complexity-theoretic dichotomy: QCSP(H) is either in NL or is NP-hard. The separating conditions are somewhat esoteric hence the epithet "wavy line of tractability".
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.