偏序维数问题的复杂性-缩小差距
The Complexity of the Partial Order Dimension Problem - Closing the Gap
摘要:
偏序$P$的维数是交集为$P$的线性序的最小数目。有有效的算法来测试偏序是否具有至多$2$的维数。在1982年Yannakakis表明,为$k\geq 3$测试,如果偏序有维度$\leq k$是NP完全的。偏序$P$的高度是$P$中链的最大大小。Yannakakis还证明了,对于$k\geq 4$,测试高度$2$的偏序是否具有维数$\leq k$是NP完全的。决定高度顺序$2$是否具有尺寸$3$的复杂性是开放的。这个问题成为一个最有名的开放问题,在维数论的偏序。我们证明了这个问题是NP完全的。从技术上讲,我们证明了维数的判定问题(3DH 2)等价于判定二分三角形包含表示(BTCon)的存在性。这个问题允许从一类已知为NP-困难的平面可满足性问题(P-3-CON-3-SAT(4))中约化。
英文摘要:
The dimension of a partial order $P$ is the minimum number of linear orders whose intersection is $P$. There are efficient algorithms to test if a partial order has dimension at most $2$. In 1982 Yannakakis showed that for $k\geq 3$ to test if a partial order has dimension $\leq k$ is NP-complete. The height of a partial order $P$ is the maximum size of a chain in $P$. Yannakakis also showed that for $k\geq 4$ to test if a partial order of height $2$ has dimension $\leq k$ is NP-complete. The complexity of deciding whether an order of height $2$ has dimension $3$ was left open. This question became one of the best known open problems in dimension theory for partial orders. We show that the problem is NP-complete. Technically we show that the decision problem (3DH2) for dimension is equivalent to deciding for the existence of bipartite triangle containment representations (BTCon). This problem then allows a reduction from a class of planar satisfiability problems (P-3-CON-3-SAT(4)) which is known to be NP-hard.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。