There is a newer version of this record available.

Preprint Open Access

P versus NP

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? 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 classes are L and NL. Whether L = NL is another fundamental question that it is as important as it is unresolved. We demonstrate if L is not equal to NL, then P = NP. In addition, we show if L is equal to NL, then P = NP. In this way, we prove the complexity class P is equal to NP. Furthermore, we demonstrate the complexity class NL is equal to NP.

Files (449.1 kB)
Name Size
manuscript.pdf
md5:e00a1451a6f9f0169cae33ddd5ebd347
449.1 kB Download
475
343
views
downloads
All versions This version
Views 4757
Downloads 3434
Data volume 148.8 MB1.8 MB
Unique views 3635
Unique downloads 2602

Share

Cite as