There is a newer version of this record available.

Preprint Open Access

P versus NP

Frank Vega


Citation Style Language JSON Export

{
  "publisher": "Zenodo", 
  "DOI": "10.5281/zenodo.3660774", 
  "title": "P versus NP", 
  "issued": {
    "date-parts": [
      [
        2020, 
        2, 
        10
      ]
    ]
  }, 
  "abstract": "<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 L is equal to NP.</p>", 
  "author": [
    {
      "family": "Frank Vega"
    }
  ], 
  "type": "article", 
  "id": "3660774"
}
1,320
616
views
downloads
All versions This version
Views 1,32039
Downloads 61620
Data volume 263.1 MB9.0 MB
Unique views 73032
Unique downloads 47020

Share

Cite as