P=NP is True
收藏Zenodo2025-12-21 更新2026-05-26 收录
下载链接：
https://zenodo.org/doi/10.5281/zenodo.18007107
下载链接
链接失效反馈官方服务：
资源简介：
This work documents the proof that the complexity class NP is equivalent to the class P. Using the Pezzotti Method, we demonstrate that decision and search problems deemed “exponential” can be solved in polynomial time O(n^k). The key to the solution lies in Rank Saturation: by identifying the constraint order and operating in finite fields \mathbb{F}_p, the system instantly detects the fertility (solution) or sterility (impossibility) of the variety of constraints.
提供机构：
Zenodo创建时间：
2025-12-21
