QCSP on reflexive tournaments
We give a complexity dichotomy for the Quantified Constraint Satisfaction Problem QCSP(H) when H is a reflexive tournament. It is well known that reflexive tournaments can be split into a sequence of strongly connected components H1,…,Hn so that there exists an edge from every vertex of Hi to every...
Full description
Bibliographic Details
Main Authors: |
Larose, B,
Martin, B,
Marković, P,
Paulusma, D,
Smith, S,
Živný, S |
Format: | Journal article
|
Language: | English |
Published: |
Association for Computing Machinery
2022
|