Planned intervention: On Wednesday April 3rd 05:30 UTC Zenodo will be unavailable for up to 2-10 minutes to perform a storage cluster upgrade.
Published June 2, 2019 | Version v5
Preprint Open

The P versus NP Problem

Creators

  • 1. Joysonic

Description

P versus NP is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? 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. To attack the P versus NP problem, the NP-completeness is a useful tool. We prove the known NP-complete problem MONOTONE 1-IN-3 3SAT can be polynomially reduced to the polynomial language 2SET PACKING. In this way, MONOTONE 1-IN-3 3SAT must be in P. If any NP-complete problem can be solved in polynomial time, then every language in NP has a polynomial time algorithm. Hence, we demonstrate the complexity class P is equal to NP.

Files

manuscript.pdf

Files (254.1 kB)

Name Size Download all
md5:8c3be2c1e9b231f1b8e0d04e07f3c02d
254.1 kB Preview Download