There is a newer version of this record available.

Preprint Open Access

# P versus NP

Frank Vega

### JSON Export

{
"files": [
{
"self": "https://zenodo.org/api/files/a43ee014-22ec-4199-b638-3dcb1de6678c/manuscript.pdf"
},
"checksum": "md5:3eedbfa2bded5eb15f9d5024e1c24044",
"bucket": "a43ee014-22ec-4199-b638-3dcb1de6678c",
"key": "manuscript.pdf",
"type": "pdf",
"size": 449465
}
],
"owners": [
45971
],
"doi": "10.5281/zenodo.3605338",
"stats": {
"unique_views": 146.0,
"views": 155.0,
"version_views": 2098.0,
"version_unique_views": 1384.0,
"volume": 53486335.0,
"version_volume": 524536768.0
},
"doi": "https://doi.org/10.5281/zenodo.3605338",
"conceptdoi": "https://doi.org/10.5281/zenodo.3355776",
"bucket": "https://zenodo.org/api/files/a43ee014-22ec-4199-b638-3dcb1de6678c",
"html": "https://zenodo.org/record/3605338",
"latest_html": "https://zenodo.org/record/4393095",
"latest": "https://zenodo.org/api/records/4393095"
},
"conceptdoi": "10.5281/zenodo.3355776",
"created": "2020-01-12T03:11:53.940396+00:00",
"updated": "2020-12-24T22:35:28.839158+00:00",
"conceptrecid": "3355776",
"revision": 107,
"id": 3605338,
"access_right_category": "success",
"doi": "10.5281/zenodo.3605338",
"description": "<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 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.</p>",
"id": "CC-BY-4.0"
},
"title": "P versus NP",
"relations": {
"version": [
{
"count": 132,
"index": 32,
"parent": {
"pid_type": "recid",
"pid_value": "3355776"
},
"is_last": false,
"last_child": {
"pid_type": "recid",
"pid_value": "4393095"
}
}
]
},
"keywords": [
"complexity classes",
"completeness",
"one-way",
"reduction",
"polynomial time",
"logarithmic space"
],
"publication_date": "2020-01-12",
"creators": [
{
"orcid": "0000-0001-8210-4126",
"affiliation": "Joysonic",
"name": "Frank Vega"
}
],
"access_right": "open",
"resource_type": {
"subtype": "preprint",
"type": "publication",
"title": "Preprint"
},
"related_identifiers": [
{
"scheme": "doi",
"identifier": "10.5281/zenodo.3355776",
"relation": "isVersionOf"
}
]
}
}
2,098
1,195
views