最小的硬树
The Smallest Hard Trees
摘要:
我们找到了一个方向的树与20顶点,使相应的固定模板约束满足问题(CSP)是NP-完全的,并证明了,对于每一个方向的树与较少的顶点,相应的CSP可以在多项式时间内解决。我们还计算了NL困难的最小树(假设L不是NL),不能通过弧一致性解决的最小树,以及不能通过Datalog解决的最小树。我们的实验结果也支持了布林的一个猜想有关的问题地狱,Nesetril和朱,即“容易树缺乏计数的能力”。大多数证明是基于计算机的,并利用最新的通用代数理论的复杂性有限域CSP。然而,由于树木的方向数量巨大,需要进一步的想法。特别是,我们使用众所周知的事实,它足以研究的树木,核心的方向,并显示如何有效地决定是否一个给定的方向的树是一个核心,使用弧一致性程序。此外,我们提出了一种方法来产生的方向的树的核心,在实践中工作得很好。通过这种方式,我们发现了有趣的例子,开放的研究问题,分类有限域CSP在NL。
英文摘要:
We find an orientation of a tree with 20 vertices such that the corresponding fixed-template constraint satisfaction problem (CSP) is NP-complete, and prove that for every orientation of a tree with fewer vertices the corresponding CSP can be solved in polynomial time. We also compute the smallest tree that is NL-hard (assuming L is not NL), the smallest tree that cannot be solved by arc consistency, and the smallest tree that cannot be solved by Datalog. Our experimental results also support a conjecture of Bulin concerning a question of Hell, Nesetril and Zhu, namely that "easy trees lack the ability to count". Most proofs are computer-based and make use of the most recent universal-algebraic theory about the complexity of finite-domain CSPs. However, further ideas are required because of the huge number of orientations of trees. In particular, we use the well-known fact that it suffices to study orientations of trees that are cores and show how to efficiently decide whether a given orientation of a tree is a core using the arc-consistency procedure. Moreover, we present a method to generate orientations of trees that are cores that works well in practice. In this way we found interesting examples for the open research problem to classify finite-domain CSPs in NL.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。