arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0808.0023cs.CCcs.CRmath.COmath.OC
收藏

低密度子集和问题不可行性的分支证明

Branching proofs of infeasibility in low density subset sum problems

Gabor Pataki, Mustafa Tural

摘要:

我们证明了子集和问题有一个多项式时间的可计算证书的不可行性的密度最多$1/(2n)$和几乎所有的整数右手边的所有$a$权重向量。该证书是分支上的超平面,即通过一种方法的双重一个探索由Lagarias和Odlyzko;弗里兹;弗斯特和Kannan;和Coster等。证明有两个要素。我们首先证明了一个矢量是接近平行于$a$是一个合适的分支方向,无论密度。然后,我们表明,对于一个低密度$a$这样一个近平行的矢量可以计算使用丢番图近似,通过弗兰克和Tardos介绍的方法。我们还表明,有一个小数目的长区间,其不相交的工会涵盖了整数的右手边,其中的不可行性证明了上述超平面上的分支。

英文摘要:

We prove that the subset sum problem has a polynomial time computable certificate of infeasibility for all $a$ weight vectors with density at most $1/(2n)$ and for almost all integer right hand sides. The certificate is branching on a hyperplane, i.e. by a methodology dual to the one explored by Lagarias and Odlyzko; Frieze; Furst and Kannan; and Coster et. al. The proof has two ingredients. We first prove that a vector that is near parallel to $a$ is a suitable branching direction, regardless of the density. Then we show that for a low density $a$ such a near parallel vector can be computed using diophantine approximation, via a methodology introduced by Frank and Tardos. We also show that there is a small number of long intervals whose disjoint union covers the integer right hand sides, for which the infeasibility is proven by branching on the above hyperplane.

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

↑