arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0808.3222cs.CC
收藏

卡普定理的几个假设分析

Analysis of the postulates produced by Karp's Theorem

Jerrald Meek

摘要:

这是一系列四篇文章中的最后一篇。Richard Karp证明了K-SAT的确定性多项式时间解将导致所有NP完全问题的确定性多项式时间解。然而,它表明,一个确定性的多项式时间解决任何NP完全问题并不一定产生一个确定性的多项式时间解决所有NP完全问题。

英文摘要:

This is the final article in a series of four articles. Richard Karp has proven that a deterministic polynomial time solution to K-SAT will result in a deterministic polynomial time solution to all NP-Complete problems. However, it is demonstrated that a deterministic polynomial time solution to any NP-Complete problem does not necessarily produce a deterministic polynomial time solution to all NP-Complete problems.

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

↑