Download PDFOpen PDF in browserCurrent versionNote for the P versus NP ProblemEasyChair Preprint 11886, version 64 pages•Date: March 10, 2024AbstractP versus NP is considered as one of the most fundamental open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? It was essentially mentioned in 1955 from a letter written by John Nash to the United States National Security Agency. However, a precise statement of the P versus NP problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. Another major complexity class is NPcomplete. It is wellknown that P is equal to NP under the assumption of the existence of a polynomial time algorithm for some NPcomplete. We show that the Monotone Weighted Xor 2satisfiability problem (MWX2SAT) is NPcomplete and P at the same time. Certainly, we make a polynomial time reduction from every directed graph and positive integer k in the KCLOSURE problem to an instance of MWX2SAT. In this way, we show that MWX2SAT is also an NPcomplete problem. Moreover, we create and implement a polynomial time algorithm which decides the instances of MWX2SAT. Consequently, we prove that P = NP. Keyphrases: completeness, complexity classes, computational algorithm, polynomial time, reduction
