arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0706.3459cs.CCmath.CO
收藏

通过提升和阴影实现NP

NP by means of lifts and shadows

Gabor Kun, Jaroslav Nesetril

摘要:

我们证明了每个NP问题多项式等价于一个简单的组合问题:一类特殊有向图的成员问题。这些类是通过阴影(投影)和许多禁止的有色(提升)子图来定义的。我们的表征是出于分析的语法子类与NP的全部计算能力,这是第一次研究Feder和Vardi。我们的方法适用于许多组合问题,它导致的着色问题(CSP)的特征定义的阴影。这与同态对偶有关。证明了一类由多个禁止着色子图(即提升子结构)定义的有向图(关系结构)是CSP类当且仅当所有的禁止结构同态等价于树.我们展示了一个令人惊讶的丰富的着色问题时,仅限于最常见的图形类。利用Nešetzil和Ossona de Mendez关于有界扩张类(包括有界度和真次闭类)的结果,证明了每一个被定义为多个着色子图的阴影的类的限制都等于一个着色(CSP)类的限制.

英文摘要:

We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by means of shadows (projections) and by finitely many forbidden colored (lifted) subgraphs. Our characterization is motivated by the analysis of syntactical subclasses with the full computational power of NP, which were first studied by Feder and Vardi. Our approach applies to many combinatorial problems and it induces the characterization of coloring problems (CSP) defined by means of shadows. This turns out to be related to homomorphism dualities. We prove that a class of digraphs (relational structures) defined by finitely many forbidden colored subgraphs (i.e. lifted substructures) is a CSP class if and only if all the the forbidden structures are homomorphically equivalent to trees. We show a surprising richness of coloring problems when restricted to most frequent graph classes. Using results of Nešetřil and Ossona de Mendez for bounded expansion classes (which include bounded degree and proper minor closed classes) we prove that the restriction of every class defined as the shadow of finitely many colored subgraphs equals to the restriction of a coloring (CSP) class.

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

↑