关于P vs NP问题：一个不等式的证明
On the P vs NP question: a proof of inequality
摘要：
本文讨论的分析是基于一个著名的NP完全问题，这是所谓的可满足性问题或SAT。从可满足性出发，导出了一个新的NP完全问题，该问题用一个称为核函数的布尔函数来描述。本文证明了核函数的最小实现的代价随n的增加呈指数增长。由于核函数的综合是一个NP完全问题，这个结果等价于证明P和NP不一致。
英文摘要：
The analysis discussed in this paper is based on a well-known NP-complete problem which is called satisfiability problem or SAT. From SAT a new NP-complete problem is derived, which is described by a Boolean function called core function. In this paper it is proved that the cost of the minimal implementation of core function increases with n exponentially. Since the synthesis of core function is an NP-complete problem, this result is equivalent to proving that P and NP do not coincide.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
