There is a newer version of this record available.

Preprint Open Access

P vs NP

Frank Vega

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.

Files (398.3 kB)
Name Size
paper.pdf
md5:4d3cb3fa000623667d48b7151b6c4a9c
398.3 kB Download
68
23
views
downloads
All versions This version
Views 6822
Downloads 239
Data volume 9.2 MB3.6 MB
Unique views 6118
Unique downloads 208

Share

Cite as