论文标题
ZFC Limbo中的子集总实例
Subset Sum Instances in ZFC Limbo
论文作者
论文摘要
我们的主要结果定理2.5显示了在多项式时间内可解决的大量子集总和问题的存在。我们对此结果的唯一证明使用了ZFC独立跳跃弗里德曼的免费定理，从而将定理2.5放在我们所谓的ZFC Limbo中。我们使用的数学是基本的，并且在算法的组合学或设计和分析方面的本科课程层面。在此级别上也很容易理解跳跃定理的陈述（但没有证明）。
Our main result, Theorem 2.5, shows the existence of a vast infinity of subset sum problems solvable in polynomial time. The only proof we have of this result uses the ZFC independent Jump Free Theorem of Harvey Friedman, thus putting Theorem 2.5 in what we call ZFC limbo. The mathematics we use is elementary and at the level of a good undergraduate course in combinatorics or design and analysis of algorithms. The statement of the Jump Free Theorem is also easily understood at this level (but not the proof).
