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 equal to NL, then L = NP. In this way, we demonstrate that the L versus NL problem is as hard as P versus NP.

Files (404.3 kB)
Name Size
manuscript.pdf
md5:030eef433c46a67bfd221531cd864cb0
404.3 kB Download
1,320
613
views
downloads
All versions This version
Views 1,3207
Downloads 6136
Data volume 261.8 MB2.4 MB
Unique views 7307
Unique downloads 4676

Share

Cite as