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.2 kB)
Name Size
manuscript.pdf
md5:60d3ea77676eb64fab1c770d66656934
449.2 kB Download
1,618
835
views
downloads
All versions This version
Views 1,61835
Downloads 83528
Data volume 362.2 MB12.6 MB
Unique views 96535
Unique downloads 65626

Share

Cite as