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 H_1,...,H_n so that there exists an edge from every vertex of H_i to e...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2021-12
Main Authors: Larose, Benoit, Markovic, Petar, Barnaby, Martin, Paulusma, Daniel, Smith, Siani, Zivny, Stanislav
Format: Article
Language:English
Subjects:
Tournaments & championships
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 H_1,...,H_n so that there exists an edge from every vertex of H_i to every vertex of H_j if and only if i
ISSN:2331-8422
DOI:10.48550/arxiv.2104.10570