ACM Transactions on Computational Logic (TOCL): Volume 18 Issue 1, April 2017
Citation Count: 0
Downloads (6 Weeks): 2, Downloads (12 Months): 13, Downloads (Overall): 45
Full text available:
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 ...
Quantified constraints, complexity, polymorphism, semicomplete digraphs