NP on Logarithmic Space

EasyChair Preprint 9555, version 7

Abstract

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 prove that if L = NL, then every NP problem is in L with oracle access to L.

Keyphrases: completeness, complexity classes, logarithmic space, polynomial time, reduction

@booklet{EasyChair:9555,
  author    = {Frank Vega},
  title     = {NP on Logarithmic Space},
  howpublished = {EasyChair Preprint 9555},
  year      = {EasyChair, 2023}}