There is a newer version of this record available.

Preprint Open Access

# On P versus NP

Frank Vega

### DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<identifier identifierType="DOI">10.5281/zenodo.2596331</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>On P versus NP</title>
</titles>
<publisher>Zenodo</publisher>
<publicationYear>2019</publicationYear>
<subjects>
<subject>P</subject>
<subject>NP</subject>
<subject>coNP</subject>
<subject>coNP-complete</subject>
<subject>Minimum</subject>
<subject>Boolean circuit</subject>
</subjects>
<dates>
<date dateType="Issued">2019-03-17</date>
</dates>
<resourceType resourceTypeGeneral="Text">Preprint</resourceType>
<alternateIdentifiers>
<alternateIdentifier alternateIdentifierType="url">https://zenodo.org/record/2596331</alternateIdentifier>
</alternateIdentifiers>
<relatedIdentifiers>
<relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.5281/zenodo.2588891</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 great open problems of science. This consists in knowing the answer of the following question: Is P equal to NP? This problem was first mentioned in a letter written by John Nash to the National Security Agency in 1955. 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 huge problem have failed. Another major complexity class is coNP. Whether NP = coNP is another fundamental question that it is as important as it is unresolved. To attack the P versus NP problem, the concept of coNP-completeness is very useful. We prove there is a problem in coNP-complete that is not in P. In this way, we show that P is not equal to coNP. Since P = NP implies P = coNP, then we also demonstrate that P is not equal to NP.&lt;/p&gt;</description>
<description descriptionType="Other">Archived previous version in https://hal.archives-ouvertes.fr/hal-01509423</description>
</descriptions>
</resource>

1,023
525
views