Quantified Constraint Satisfaction Problem on Semicomplete Digraphs.
ACM Trans. Comput. Log.(2017)
摘要
We study the (non-uniform) quantified constraint satisfaction problem QCSP(H) as H ranges over semicomplete digraphs. We obtain a complexity-theoretic trichotomy: QCSP(H) is either in P, is NP-complete, or is Pspace-complete. The largest part of our work is the algebraic classification of precisely which semicomplete digraphs enjoy only essentially unary polymorphisms, which is combinatorially interesting in its own right.
更多查看译文
关键词
Quantified constraints,complexity,polymorphism,semicomplete digraphs
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要