3660774
doi
10.5281/zenodo.3660774
oai:zenodo.org:3660774
P versus NP
Frank Vega
Joysonic
info:eu-repo/semantics/openAccess
Creative Commons Attribution 4.0 International
https://creativecommons.org/licenses/by/4.0/legalcode
complexity classes
completeness
one-way
reduction
polynomial time
logarithmic space
<p>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 L is equal to NP.</p>
Zenodo
2020-02-10
info:eu-repo/semantics/preprint
3355776
1612915807.810425
451995
md5:9411eca21c3fa46f7de5f3489550033a
https://zenodo.org/records/3660774/files/manuscript.pdf
public
10.5281/zenodo.3355776
isVersionOf
doi