两个平面问题的树型分解复杂性
Tree-like resolution complexity of two planar problems
摘要:
我们考虑两个CSP问题:第一CSP编码用于直角三角形在$n^2$小三角形上的标准三角剖分的2D Sperner引理;第二CSP对不可能将$n \times n$正方形的单元与箭头匹配的事实进行编码(两个水平、两个垂直和四个对角线),使得具有公共边缘的两个单元中的箭头最多相差$45^\circ$,并且正方形边界上的所有箭头都不向外看(这一事实是布劳尔不动点定理的推论)。我们证明了这些CSP的树状分解复杂度是$2^{Θ(n)}$。对于Sperner引理我们的结果意味着$Ω(n)$下限的数量要求的颜色的顶点,这是足以使为了找到一个三色三角形;这个下限最初证明了Crescenzi和Silvestri。基于Sperner引理的CSP与$\rm PPAD$ -完全问题有关。我们表明,CSP对应的箭头也与$\rm PPAD$ -完全问题。
英文摘要:
We consider two CSP problems: the first CSP encodes 2D Sperner's lemma for the standard triangulation of the right triangle on $n^2$ small triangles; the second CSP encodes the fact that it is impossible to match cells of $n \times n$ square to arrows (two horizontal, two vertical and four diagonal) such that arrows in two cells with a common edge differ by at most $45^\circ$, and all arrows on the boundary of the square do not look outside (this fact is a corollary of the Brower's fixed point theorem). We prove that the tree-like resolution complexities of these CSPs are $2^{Θ(n)}$. For Sperner's lemma our result implies $Ω(n)$ lower bound on the number of request to colors of vertices that is enough to make in order to find a trichromatic triangle; this lower bound was originally proved by Crescenzi and Silvestri. CSP based on Sperner's lemma is related with the $\rm PPAD$-complete problem. We show that CSP corresponding to arrows is also related with a $\rm PPAD$-complete problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。