QCSP on partially reflexive cycles - the wavy line of tractability
Computational Complexity
2013-03-04 v1
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".
Keywords
Cite
@article{arxiv.1303.0041,
title = {QCSP on partially reflexive cycles - the wavy line of tractability},
author = {Florent Madelaine and Barnaby Martin},
journal= {arXiv preprint arXiv:1303.0041},
year = {2013}
}
Comments
Extended abstract at CSR 2013