The P versus NP problem asks whether every language verifiable in polynomial time can also be decided in deterministic polynomial time. In this paper, we present a constructive proof that P=NP by introducing a universal, graph-based deterministic framework applicable to all NP problems without requiring reduction to an NP-complete problem. We model computational transitions as edges within a unified graph structure, where edges correspond to the steps of a deterministic verifier Turing machine for all possible certificates. Due to the overlap of edges among computation paths, the total cardinality of the edge set remains polynomially bounded. Furthermore, by employing a certificate--oblivious verifier Turing machine--whose head movement is independent of the certificate contents--we force all computation paths to align their edge transitions. A key feature of our approach is that each extension step enforces global consistency via a local infeasibility trimming tool. This mechanism systematically preserves valid NP paths that lead to the target edge under polynomial verification, ensuring the graph remains globally feasible at every stage without explicit enumeration. This represents a paradigm shift from searching over exponential certificates to the incremental extension of verified edges. Since our construction decides all NP problems in deterministic polynomial time, it provides a direct resolution to the P versus NP question and demonstrates that every NP problem can be solved in deterministic polynomial time via incremental graph edge extension.

翻译：暂无翻译