Download PDFOpen PDF in browserCurrent versionP versus NPEasyChair Preprint 3061, version 18 pages•Date: March 29, 2020AbstractP 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. Keyphrases: completeness, complexity classes, logarithmic space, one-way, polynomial time, reduction
|