There is a newer version of this record available.

Preprint Open Access

P versus NP

Frank Vega


JSON-LD (schema.org) Export

{
  "description": "<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 NL is equal to NP.</p>", 
  "license": "https://creativecommons.org/licenses/by/4.0/legalcode", 
  "creator": [
    {
      "affiliation": "Joysonic", 
      "@id": "https://orcid.org/0000-0001-8210-4126", 
      "@type": "Person", 
      "name": "Frank Vega"
    }
  ], 
  "headline": "P versus NP", 
  "image": "https://zenodo.org/static/img/logos/zenodo-gradient-round.svg", 
  "datePublished": "2020-01-12", 
  "url": "https://zenodo.org/record/3605338", 
  "keywords": [
    "complexity classes", 
    "completeness", 
    "one-way", 
    "reduction", 
    "polynomial time", 
    "logarithmic space"
  ], 
  "@context": "https://schema.org/", 
  "identifier": "https://doi.org/10.5281/zenodo.3605338", 
  "@id": "https://doi.org/10.5281/zenodo.3605338", 
  "@type": "ScholarlyArticle", 
  "name": "P versus NP"
}
1,726
921
views
downloads
All versions This version
Views 1,726153
Downloads 921118
Data volume 400.7 MB53.0 MB
Unique views 1,049144
Unique downloads 725109

Share

Cite as