There is a newer version of this record available.

Preprint Open Access

# P versus NP

Frank Vega

### DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<identifier identifierType="DOI">10.5281/zenodo.3605338</identifier>
<creators>
<creator>
<creatorName>Frank Vega</creatorName>
<nameIdentifier nameIdentifierScheme="ORCID" schemeURI="http://orcid.org/">0000-0001-8210-4126</nameIdentifier>
<affiliation>Joysonic</affiliation>
</creator>
</creators>
<titles>
<title>P versus NP</title>
</titles>
<publisher>Zenodo</publisher>
<publicationYear>2020</publicationYear>
<subjects>
<subject>complexity classes</subject>
<subject>completeness</subject>
<subject>one-way</subject>
<subject>reduction</subject>
<subject>polynomial time</subject>
<subject>logarithmic space</subject>
</subjects>
<dates>
<date dateType="Issued">2020-01-12</date>
</dates>
<resourceType resourceTypeGeneral="Text">Preprint</resourceType>
<alternateIdentifiers>
<alternateIdentifier alternateIdentifierType="url">https://zenodo.org/record/3605338</alternateIdentifier>
</alternateIdentifiers>
<relatedIdentifiers>
<relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.5281/zenodo.3355776</relatedIdentifier>
</relatedIdentifiers>
<rightsList>
<rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
</rightsList>
<descriptions>
<description descriptionType="Abstract">&lt;p&gt;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 NL is equal to NP.&lt;/p&gt;</description>
</descriptions>
</resource>

1,716
911
views