arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1501.04558cs.CC
收藏

从复杂性到代数再返回:有向图类,可扩展性和PGP

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

Catarina Carvalho, Florent Madelaine, Barnaby Martin

摘要:

受量化约束满足问题的计算复杂性结果的启发,我们研究了某些有向图类的幂等多态克隆。我们的第一个结果是两个代数二分法,甚至“差距”,定理。建立和扩展[Martin CP'11],我们证明了部分自反路径遗留一组幂等多态性,其相关的克隆代数有:多项式生成的权力财产(PGP),或指数生成的权力财产(EGP)。类似地,我们在[DaMM ICALP'14]的基础上证明了半完全有向图具有相同的性质。这些差距定理的进一步动机,新的证据表明,PGP可能是代数解释,QCSP是在NP,即使是无限的交替。一路上,我们还影响了PGP的一个具体形式的研究,称为可扩展性,绑在一起的代数和结构线程从[陈Sicomp'08],并表明,可扩展性是等价的$Π_2$ -限制。我们还给出了一个决策过程$k$ -可扩展性从一个单一的源的有限结构(可扩展性的形式,其中包括所有已知的例子PGP有限结构)。最后,我们提出了一个新的QCSP的剖分结果,部分自反的道路与常数。如果没有常数,我们知道这些QCSP是NL或Pspace-complete [Martin CP'11],但我们证明了常数,他们达到三个复杂性NL,NP-complete和Pspace-complete。

英文摘要:

Inspired by computational complexity results for the quantified constraint satisfaction problem, we study the clones of idempotent 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 idempotent 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 semicomplete 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 $Π_2$-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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑