NP on Logarithmic Space [article]

Frank Vega
2023 Zenodo  
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
more » ... mplexity classes are L and NL. Whether L = NL is another fundamental question that it is as important as it is unresolved. We prove the breakthrough result that L = NL. Besides, we show that every NP problem is in L with oracle access to L.
doi:10.5281/zenodo.7514117 fatcat:rqkwyvsbn5g5bkwmcgsmpigksm