arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0711.1177cs.CCcs.LO
收藏

关于P与NP的思考

Considerations on P vs NP

Alfredo von Reckow

摘要:

为了证明问题的P不同于NP类,我们考虑了命题演算公式的可满足性问题,这是一个NP完全问题。证明了对每个搜索算法A,存在一个包含命题演算公式的集合E(A),每个命题演算公式都要求算法A用非多项式时间找到满足它的命题字母的真值,并且E(A)的大小是n的指数函数,这使得在多项式时间内检测这些公式是不可能的.因此,可满足性问题不具有多项式复杂度

英文摘要:

In order to prove that the P of problems is different to the NP class, we consider the satisfability problem of propositional calculus formulae, which is an NP-complete problem. It is shown that, for every search algorithm A, there is a set E(A) containing propositional calculus formulae, each of which requires the algorithm A to take non-polynomial time to find the truth-values of its propositional letters satisfying it. Moreover, E(A)'s size is an exponential function of n, which makes it impossible to detect such formulae in a polynomial time. Hence, the satisfability problem does not have a polynomial complexity

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

↑