Preprint Open Access
Frank Vega
<?xml version='1.0' encoding='utf-8'?> <resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd"> <identifier identifierType="DOI">10.5281/zenodo.1285952</identifier> <creators> <creator> <creatorName>Frank Vega</creatorName> <affiliation>Joysonic</affiliation> </creator> </creators> <titles> <title>P vs NP</title> </titles> <publisher>Zenodo</publisher> <publicationYear>2018</publicationYear> <subjects> <subject>Complexity Classes</subject> <subject>Completeness</subject> <subject>Polynomial Time</subject> <subject>3SAT</subject> <subject>Quadratic Residue</subject> </subjects> <dates> <date dateType="Issued">2018-06-08</date> </dates> <resourceType resourceTypeGeneral="Text">Preprint</resourceType> <alternateIdentifiers> <alternateIdentifier alternateIdentifierType="url">https://zenodo.org/record/1285952</alternateIdentifier> </alternateIdentifiers> <relatedIdentifiers> <relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.5281/zenodo.1285951</relatedIdentifier> </relatedIdentifiers> <rightsList> <rights rightsURI="https://creativecommons.org/licenses/by/4.0/legalcode">Creative Commons Attribution 4.0 International</rights> <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights> </rightsList> <descriptions> <description descriptionType="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 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.</p></description> </descriptions> </resource>
All versions | This version | |
---|---|---|
Views | 96 | 31 |
Downloads | 54 | 16 |
Data volume | 21.5 MB | 6.4 MB |
Unique views | 88 | 27 |
Unique downloads | 51 | 15 |