Preprint Open Access

The P versus NP Problem

Frank Vega

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 (254.1 kB)
Name Size
manuscript.pdf
md5:8c3be2c1e9b231f1b8e0d04e07f3c02d
254.1 kB Download
124
89
views
downloads
All versions This version
Views 12482
Downloads 8958
Data volume 22.6 MB14.7 MB
Unique views 10076
Unique downloads 6851

Share

Cite as