June 8, 2018 Preprint Open Access

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 is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute. This question was first mentioned in a letter written by John Nash to the National Security Agency in 1955. 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. To attack the P versus NP question the concept of NP-completeness has been very useful. If any single NP-complete problem can be solved in polynomial time, then every NP problem has a polynomial time algorithm. MONOTONE 3SAT is a known NP-complete problem. We prove MONOTONE 3SAT is in P. In this way, we demonstrate the P versus NP problem.</p>", 
  "license": "https://creativecommons.org/licenses/by/4.0/legalcode", 
  "creator": [
    {
      "affiliation": "Joysonic", 
      "@type": "Person", 
      "name": "Frank Vega"
    }
  ], 
  "headline": "P vs NP", 
  "image": "https://zenodo.org/static/img/logos/zenodo-gradient-round.svg", 
  "datePublished": "2018-06-08", 
  "url": "https://zenodo.org/record/1285952", 
  "keywords": [
    "Complexity Classes", 
    "Completeness", 
    "Polynomial Time", 
    "3SAT", 
    "Quadratic Residue"
  ], 
  "@context": "https://schema.org/", 
  "identifier": "https://doi.org/10.5281/zenodo.1285952", 
  "@id": "https://doi.org/10.5281/zenodo.1285952", 
  "@type": "ScholarlyArticle", 
  "name": "P vs NP"
}