There is a newer version of this record available.

Preprint Open Access

On P versus NP

Frank Vega


JSON-LD (schema.org) Export

{
  "description": "<p>P versus NP is considered as one of the great open problems of science. This consists in knowing the answer of the following question: Is P equal to NP? This problem was first mentioned in a letter written by John Nash to the National Security Agency in 1955. 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 huge problem have failed. Another major complexity class is coNP. Whether NP = coNP is another fundamental question that it is as important as it is unresolved. To attack the P versus NP problem, the concept of coNP-completeness is very useful. We prove there is a problem in coNP-complete that is not in P. In this way, we show that P is not equal to coNP. Since P = NP implies P = coNP, then we also demonstrate that P is not 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": "On P versus NP", 
  "image": "https://zenodo.org/static/img/logos/zenodo-gradient-round.svg", 
  "datePublished": "2019-03-17", 
  "url": "https://zenodo.org/record/2596331", 
  "keywords": [
    "P", 
    "NP", 
    "coNP", 
    "coNP-complete", 
    "Minimum", 
    "Boolean circuit"
  ], 
  "@context": "https://schema.org/", 
  "identifier": "https://doi.org/10.5281/zenodo.2596331", 
  "@id": "https://doi.org/10.5281/zenodo.2596331", 
  "@type": "ScholarlyArticle", 
  "name": "On P versus NP"
}
1,023
525
views
downloads
All versions This version
Views 1,02336
Downloads 52516
Data volume 99.3 MB3.2 MB
Unique views 84031
Unique downloads 41913

Share

Cite as