University of Hertfordshire

By the same authors

From complexity to algebra and back: digraph classes, collapsibility and the PGP

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Documents

  • 907109

    Accepted author manuscript, 830 KB, PDF-document

View graph of relations
Original languageEnglish
Title of host publicationProceedings of the 2015 30th Annual ACM / IEEE Symposium on logic in Computer Science (LICS)
PublisherIEEE
Pages462-474
Number of pages13
ISBN (Print)1043-6871
DOIs
StatePublished - 3 Aug 2015
Event30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2015) - Kyoto, Japan

Conference

Conference30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2015)
CountryJapan
CityKyoto
Period6/07/1510/07/15

Abstract

Inspired by computational complexity results for the quantified constraint satisfaction problem, we study the clones of idem potent polymorphisms of certain digraph classes. Our first results are two algebraic dichotomy, even "gap", theorems. Building on and extending [Martin CP'11], we prove that partially reflexive paths bequeath a set of idem potent polymorphisms whose associated clone algebra has: either the polynomially generated powers property (PGP), or the exponentially generated powers property (EGP). Similarly, we build on [DaMM ICALP'14] to prove that semi complete digraphs have the same property. These gap theorems are further motivated by new evidence that PGP could be the algebraic explanation that a QCSP is in NP even for unbounded alternation. Along the way we also effect a study of a concrete form of PGP known as collapsibility, tying together the algebraic and structural threads from [Chen Sicomp'08], and show that collapsibility is equivalent to its Pi2-restriction. We also give a decision procedure for k-collapsibility from a singleton source of a finite structure (a form of collapsibility which covers all known examples of PGP for finite structures). Finally, we present a new QCSP trichotomy result, for partially reflexive paths with constants. Without constants it is known these QCSPs are either in NL or Pspace-complete [Martin CP'11], but we prove that with constants they attain the three complexities NL, NP-complete and Pspace-complete.

Notes

This is the accepted version of the following article: C. Carvalho, M. Florent, & M. Barnaby, “Fom complexity to algebra and back: digraph classes, collapsibility, and the PGP”, published in Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 6-10 July 2015, IEEE Xplore Digital Library, August 2015. The final, published version is available online via doi: 10.1109/LICS.2015.50 © 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

ID: 10920723