Preprint Open Access

P vs NP

Frank Vega

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="" xmlns:oai_dc="" xmlns:xsi="" xsi:schemaLocation="">
  <dc:creator>Frank Vega</dc:creator>
  <dc:description>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.</dc:description>
  <dc:subject>Complexity Classes</dc:subject>
  <dc:subject>Polynomial Time</dc:subject>
  <dc:subject>Quadratic Residue</dc:subject>
  <dc:title>P vs NP</dc:title>
All versions This version
Views 9666
Downloads 5438
Data volume 21.5 MB15.1 MB
Unique views 8865
Unique downloads 5138


Cite as