基于E. F. Codd
A Simple Elementary Proof of P=NP based on the Relational Model of E. F. Codd
摘要：
在E. F.科德我发现“完全配置”这个术语在计算复杂性理论中是不必要的，而且是有害的，因为符号冗余过多。对于一个输入，它的完整配置的有效序列被规范化为一个没有冗余的共享配置的关系模型。为了简化问题，一个多项式时间的非确定性图灵机多项式减少到一个周期性的机器，它只反转其磁带头位移在磁带结束。通过枚举所有的O（p（n））共享内存，在对数代价下，用O（（p（n））^4）时间模拟了一个多项式时间p（n）周期机.给出了P=NP的一个简单初等证明。
英文摘要：
The P versus NP problem is studied under the relational model of E. F. Codd. I found that the term "complete configuration" is unnecessary and harmful in computational complexity theory because of excessive symbol redundancy. For an input, its valid sequences of complete configurations are normalized into a relational model of shared trichoices with no redundancy. To simplify the problem, a polynomial time nondeterministic Turing machine is polynomially reduced to a periodic machine, which only reverses its tape head displacement at the tape ends. By enumerating all the O(p(n)) shared trichoices, a polynomial time p(n) periodic machine is simulated in time O((p(n))^4) under logarithmic cost. A simple elementary proof of P=NP is obtained.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
