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? 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. 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 (440.4 kB)
Name Size
manuscript.pdf
md5:9582f09f3f2786d92542f3ad5df1a68a
440.4 kB Download
589
371
views
downloads
All versions This version
Views 58922
Downloads 37113
Data volume 160.7 MB5.7 MB
Unique views 41120
Unique downloads 27910

Share

Cite as