There is a newer version of this record available.

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 (255.4 kB)
Name Size
manuscript.pdf
md5:8007a10c8c6fe8d9e09154dbe7795e74
255.4 kB Download
123
89
views
downloads
All versions This version
Views 12319
Downloads 8912
Data volume 22.6 MB3.1 MB
Unique views 9916
Unique downloads 6811

Share

Cite as