QCSP on semicomplete digraphs

Dapić, Petar, Marković, Petar and Martin, Barnaby (2014) QCSP on semicomplete digraphs. Automata, Languages, and Programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. In: 41st International Colloquium on Automata, Languages and Programming, ICALP 2014, 8-11 Jul 2014, Copenhagen, Denmark. ISBN 9783662439470. ISSN 0302-9743 [Conference or Workshop Item]

[img]
Preview
PDF - Final accepted version (with author's formatting)
Download (285kB) | Preview

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 semicompletes enjoy only essentially unary polymorphisms, which is combinatorially interesting in its own right.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Online ISBN: 9783662439487
Published paper appears in: Automata, Languages, and Programming, Volume 8572 of the series Lecture Notes in Computer Science pp 847-858, 2014
Research Areas: A. > School of Science and Technology > Computer Science > Foundations of Computing group
Item ID: 16766
Notes on copyright: The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-43948-7_70
Useful Links:
Depositing User: Barnaby Martin
Date Deposited: 03 Jun 2015 11:10
Last Modified: 10 Jun 2021 05:54
URI: https://eprints.mdx.ac.uk/id/eprint/16766

Actions (login required)

View Item View Item