There is a newer version of this record available.

Preprint Open Access

# P vs NP

Frank Vega

### Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:creator>Frank Vega</dc:creator>
<dc:date>2018-06-08</dc:date>
<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:identifier>https://zenodo.org/record/1285952</dc:identifier>
<dc:identifier>10.5281/zenodo.1285952</dc:identifier>
<dc:identifier>oai:zenodo.org:1285952</dc:identifier>
<dc:relation>doi:10.5281/zenodo.1285951</dc:relation>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:subject>Complexity Classes</dc:subject>
<dc:subject>Completeness</dc:subject>
<dc:subject>Polynomial Time</dc:subject>
<dc:subject>3SAT</dc:subject>
<dc:title>P vs NP</dc:title>
<dc:type>info:eu-repo/semantics/preprint</dc:type>
<dc:type>publication-preprint</dc:type>
</oai_dc:dc>

92
50
views