Preprint Open Access

# P vs NP

Frank Vega

### JSON Export

{
"files": [
{
"links": {
"self": "https://zenodo.org/api/files/69454bce-6fea-4b58-b066-09033420c1b0/paper.pdf"
},
"checksum": "md5:d2f5e22b457ce38110f7cd74307c9f82",
"bucket": "69454bce-6fea-4b58-b066-09033420c1b0",
"key": "paper.pdf",
"type": "pdf",
"size": 398444
}
],
"owners": [
45971
],
"doi": "10.5281/zenodo.1286204",
"stats": {
"version_unique_downloads": 51.0,
"unique_views": 65.0,
"views": 66.0,
"version_views": 96.0,
"unique_downloads": 38.0,
"version_unique_views": 88.0,
"volume": 15140872.0,
"version_downloads": 54.0,
"downloads": 38.0,
"version_volume": 21514152.0
},
"links": {
"doi": "https://doi.org/10.5281/zenodo.1286204",
"conceptdoi": "https://doi.org/10.5281/zenodo.1285951",
"bucket": "https://zenodo.org/api/files/69454bce-6fea-4b58-b066-09033420c1b0",
"conceptbadge": "https://zenodo.org/badge/doi/10.5281/zenodo.1285951.svg",
"html": "https://zenodo.org/record/1286204",
"latest_html": "https://zenodo.org/record/1286204",
"badge": "https://zenodo.org/badge/doi/10.5281/zenodo.1286204.svg",
"latest": "https://zenodo.org/api/records/1286204"
},
"conceptdoi": "10.5281/zenodo.1285951",
"created": "2018-06-09T15:34:05.206516+00:00",
"updated": "2020-01-20T17:32:13.609611+00:00",
"conceptrecid": "1285951",
"revision": 4,
"id": 1286204,
"metadata": {
"access_right_category": "success",
"doi": "10.5281/zenodo.1286204",
"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 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>",
"license": {
"id": "CC-BY-4.0"
},
"title": "P vs NP",
"relations": {
"version": [
{
"count": 2,
"index": 1,
"parent": {
"pid_type": "recid",
"pid_value": "1285951"
},
"is_last": true,
"last_child": {
"pid_type": "recid",
"pid_value": "1286204"
}
}
]
},
"keywords": [
"Complexity Classes",
"Completeness",
"Polynomial Time",
"3SAT",
"Quadratic Residue"
],
"publication_date": "2018-06-08",
"creators": [
{
"affiliation": "Joysonic",
"name": "Frank Vega"
}
],
"access_right": "open",
"resource_type": {
"subtype": "preprint",
"type": "publication",
"title": "Preprint"
},
"related_identifiers": [
{
"scheme": "doi",
"identifier": "10.5281/zenodo.1285951",
"relation": "isVersionOf"
}
]
}
}
96
54
views
downloads
All versions This version
Views 9666
Downloads 5438
Data volume 21.5 MB15.1 MB
Unique views 8865
Unique downloads 5138