Affiliation:
1. University of Novi Sad, Serbia
2. Durham University, Durham, United Kindgom
Abstract
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.
Funder
Ministry of Education and Science of Serbia
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献