There is a newer version of this record available.

Preprint Open Access

Sparse complete sets for coNP: Solution of the P versus NP problem

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? A precise statement of the P versus NP problem was introduced independently in 1971 by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this 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. In 1979, Fortune showed that if any sparse language is coNP-complete, then P = NP. We prove there is a possible sparse language in coNP-complete. In this way, we demonstrate the complexity class P is equal to NP.</p>", 
  "license": "https://creativecommons.org/licenses/by/4.0/legalcode", 
  "creator": [
    {
      "affiliation": "Joysonic", 
      "@type": "Person", 
      "name": "Frank Vega"
    }
  ], 
  "headline": "Sparse complete sets for coNP: Solution of the P versus NP problem", 
  "image": "https://zenodo.org/static/img/logos/zenodo-gradient-round.svg", 
  "datePublished": "2018-09-17", 
  "url": "https://zenodo.org/record/1420486", 
  "keywords": [
    "Complexity Classes", 
    "Sparse", 
    "Complement Language", 
    "Completeness", 
    "Polynomial Time"
  ], 
  "@context": "https://schema.org/", 
  "identifier": "https://doi.org/10.5281/zenodo.1420486", 
  "@id": "https://doi.org/10.5281/zenodo.1420486", 
  "@type": "ScholarlyArticle", 
  "name": "Sparse complete sets for coNP: Solution of the P versus NP problem"
}
126
86
views
downloads
All versions This version
Views 12639
Downloads 8628
Data volume 22.6 MB3.1 MB
Unique views 9636
Unique downloads 6123

Share

Cite as