Planned intervention: On Wednesday April 3rd 05:30 UTC Zenodo will be unavailable for up to 2-10 minutes to perform a storage cluster upgrade.

There is a newer version of the record available.

Published February 27, 2020 | Version v44
Preprint Open

P versus NP

Creators

  • 1. Joysonic

Description

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 show if L is equal to NL, then P = NP. In addition, we demonstrate that L is equal to NL. In this way, we prove the complexity class P is equal to NP. Furthermore, we demonstrate the complexity class L is equal to NP.

Files

manuscript.pdf

Files (433.6 kB)

Name Size Download all
md5:79ccba0c34f44aa889589cf39070206d
433.6 kB Preview Download