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 that every problem in NP could be NL-reduced to another problem in L. 

Files (395.4 kB)
Name Size
manuscript.pdf
md5:7d0338876f7cb614e1b21140f80725e7
395.4 kB Download
1,320
613
views
downloads
All versions This version
Views 1,3206
Downloads 6134
Data volume 261.8 MB1.6 MB
Unique views 7306
Unique downloads 4674

Share

Cite as