Frank Vega
2020-03-19
<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 that every problem in NP could be NL-reduced to another problem in L. In addition, we show if L is equal to NL, then L = NP.</p>
https://doi.org/10.5281/zenodo.3718575
oai:zenodo.org:3718575
Zenodo
https://doi.org/10.5281/zenodo.3355776
info:eu-repo/semantics/openAccess
Creative Commons Attribution 4.0 International
https://creativecommons.org/licenses/by/4.0/legalcode
complexity classes
completeness
reduction
polynomial time
logarithmic space
one-way
P versus NP
info:eu-repo/semantics/preprint