There is a newer version of this record available.

Preprint Open Access

# Sparse complete sets for coNP: Solution of the P versus NP problem

Frank Vega

### JSON Export

{
"files": [
{
"self": "https://zenodo.org/api/files/2a3035af-a9b6-48e8-806e-4a0367dfde90/manuscript.pdf"
},
"checksum": "md5:8f3c46d2661a74c07c2f86527fa79b8b",
"bucket": "2a3035af-a9b6-48e8-806e-4a0367dfde90",
"key": "manuscript.pdf",
"type": "pdf",
"size": 110088
}
],
"owners": [
45971
],
"doi": "10.5281/zenodo.1420486",
"stats": {
"unique_views": 36.0,
"views": 39.0,
"version_views": 126.0,
"version_unique_views": 96.0,
"volume": 3082464.0,
"version_volume": 22577233.0
},
"doi": "https://doi.org/10.5281/zenodo.1420486",
"conceptdoi": "https://doi.org/10.5281/zenodo.1420485",
"bucket": "https://zenodo.org/api/files/2a3035af-a9b6-48e8-806e-4a0367dfde90",
"html": "https://zenodo.org/record/1420486",
"latest_html": "https://zenodo.org/record/1424316",
"latest": "https://zenodo.org/api/records/1424316"
},
"conceptdoi": "10.5281/zenodo.1420485",
"created": "2018-09-17T16:15:05.044400+00:00",
"updated": "2020-01-20T16:38:28.763023+00:00",
"conceptrecid": "1420485",
"revision": 8,
"id": 1420486,
"access_right_category": "success",
"doi": "10.5281/zenodo.1420486",
"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? 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. Another major complexity class is coNP. Whether NP = coNP is another fundamental question that it is as important as it is unresolved. In 1979, Fortune showed that if any sparse language is coNP-complete, then P = NP. We prove there is a possible sparse language in coNP-complete. In this way, we demonstrate the complexity class P is equal to NP.</p>",
"id": "CC-BY-4.0"
},
"title": "Sparse complete sets for coNP: Solution of the P versus NP problem",
"relations": {
"version": [
{
"count": 5,
"index": 0,
"parent": {
"pid_type": "recid",
"pid_value": "1420485"
},
"is_last": false,
"last_child": {
"pid_type": "recid",
"pid_value": "1424316"
}
}
]
},
"keywords": [
"Complexity Classes",
"Sparse",
"Complement Language",
"Completeness",
"Polynomial Time"
],
"publication_date": "2018-09-17",
"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.1420485",
"relation": "isVersionOf"
}
]
}
}
126
86
views