There is a newer version of this record available.

Preprint Open Access

The P versus NP Problem

Frank Vega

JSON-LD ( 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 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 problem, the NP-completeness is a useful tool. We prove the known NP-complete problem MONOTONE 1-IN-3 3SAT can be polynomially reduced to the polynomial language 2SET PACKING. In this way, MONOTONE 1-IN-3 3SAT must be in P. If any NP-complete problem can be solved in polynomial time, then every language in NP has a polynomial time algorithm. Hence, we demonstrate the complexity class P is equal to NP.</p>", 
  "license": "", 
  "creator": [
      "affiliation": "Joysonic", 
      "@id": "", 
      "@type": "Person", 
      "name": "Frank Vega"
  "headline": "The P versus NP Problem", 
  "image": "", 
  "datePublished": "2019-06-02", 
  "url": "", 
  "keywords": [
    "Complexity Classes", 
    "Polynomial Time", 
    "MONOTONE 1-IN-3 3SAT", 
  "@context": "", 
  "identifier": "", 
  "@id": "", 
  "@type": "ScholarlyArticle", 
  "name": "The P versus NP Problem"
All versions This version
Views 19720
Downloads 11411
Data volume 29.0 MB2.8 MB
Unique views 17220
Unique downloads 9211


Cite as