arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1405.1189math.OCcs.CCcs.DMcs.DSmath.CO
收藏

大型多路表问题

The Huge Multiway Table Problem

Shmuel Onn

摘要:

对于给定行和的$l\times m\times n$整数三向表,判定其存在性对于固定的$l=3$已经是NP完全的,但对于两个固定的$l,m$,判定其存在性在P中.这里我们考虑{ \em huge}表,其中可变维度$n$以{ \em二进制}编码。结合最近的结果整数锥和Graver基地,我们表明,如果{ \em层类型}的数量是固定的,那么问题是在P,而如果它是可变的,那么问题是在NP相交coNP。我们的治疗经历了更一般的一类$n$倍整数规划问题。

英文摘要:

Deciding the existence of an $l\times m\times n$ integer threeway table with given line-sums is NP-complete already for fixed $l=3$, but is in P with both $l,m$ fixed. Here we consider {\em huge} tables, where the variable dimension $n$ is encoded in {\em binary}. Combining recent results on integer cones and Graver bases, we show that if the number of {\em layer types} is fixed, then the problem is in P, whereas if it is variable, then the problem is in NP intersect coNP. Our treatment goes through the more general class of $n$-fold integer programming problems.

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

↑