Published March 29, 2026 | Version v1

P = NP Deterministic Resolution of SAT in Polynomial Time via Search-to-Decision Reduction

Description

This paper presents a constructive proof that $\mathbf{P = NP}$. The Boolean satisfiability problem (SAT), recognized as $\mathbf{NP}$-Complete by the Cook-Levin Theorem (1971), is addressed. A deterministic algorithm based on the \textit{search-to-decision reduction} technique is proposed, where a decision oracle ---implemented as a polynomial-time CNF verifier--- is used iteratively to construct a satisfying assignment variable by variable. It is shown that the algorithm operates in $O(n^2)$ time in the worst case, where $n$ is the number of variables in the Boolean formula. Since SAT $\in \mathbf{NP}$-Complete is solved by a deterministic algorithm in polynomial time, it is concluded that SAT $\in \mathbf{P}$, which directly implies that $\mathbf{P = NP}$.

Files

P=NP_Deterministic_Resolution_of_SAT_in_Polynomial_Time_via_Search_to_Decision_Reduction.pdf

Files (321.8 kB)

Name Size
md5:f5eaa21c5bce6f4cfc39fdf187b0a3ee
18.4 kB Download
md5:7780cb95f98175809049bc3c6f569d79
279.7 kB Preview Download
md5:bf3662a6741b265071e3f6cc452deb00
23.6 kB Preview Download