2000 character limit reached
QCSP on partially reflexive cycles - the wavy line of tractability (1303.0041v1)
Published 28 Feb 2013 in cs.CC
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".