There is a newer version of this record available.

Preprint Open Access

# The P versus NP Problem

Frank Vega

### JSON Export

{
"files": [
{
"self": "https://zenodo.org/api/files/a05cd3ec-dc35-44e2-9ff4-c0d37c51998a/manuscript.pdf"
},
"checksum": "md5:8019c4c5f8dc67bfbb6b2fc7c512b06c",
"bucket": "a05cd3ec-dc35-44e2-9ff4-c0d37c51998a",
"key": "manuscript.pdf",
"type": "pdf",
"size": 257120
}
],
"owners": [
45971
],
"doi": "10.5281/zenodo.3239377",
"stats": {
"unique_views": 20.0,
"views": 20.0,
"version_views": 197.0,
"version_unique_views": 172.0,
"volume": 2828320.0,
"version_volume": 29021321.0
},
"doi": "https://doi.org/10.5281/zenodo.3239377",
"conceptdoi": "https://doi.org/10.5281/zenodo.3237140",
"bucket": "https://zenodo.org/api/files/a05cd3ec-dc35-44e2-9ff4-c0d37c51998a",
"html": "https://zenodo.org/record/3239377",
"latest_html": "https://zenodo.org/record/3239560",
"latest": "https://zenodo.org/api/records/3239560"
},
"conceptdoi": "10.5281/zenodo.3237140",
"created": "2019-06-05T15:50:04.720185+00:00",
"updated": "2020-01-20T17:32:05.937304+00:00",
"conceptrecid": "3237140",
"revision": 7,
"id": 3239377,
"access_right_category": "success",
"doi": "10.5281/zenodo.3239377",
"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 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 problem, the NP-completeness is a useful tool. We prove the known NP-complete problem MONOTONE 1-IN-3 3SAT can be polynomially reduced to the polynomial language 2SET PACKING. In this way, MONOTONE 1-IN-3 3SAT must be in P. If any NP-complete problem can be solved in polynomial time, then every language in NP has a polynomial time algorithm. Hence, we demonstrate the complexity class P is equal to NP.</p>",
"id": "CC-BY-4.0"
},
"title": "The P versus NP Problem",
"relations": {
"version": [
{
"count": 5,
"index": 1,
"parent": {
"pid_type": "recid",
"pid_value": "3237140"
},
"is_last": false,
"last_child": {
"pid_type": "recid",
"pid_value": "3239560"
}
}
]
},
"keywords": [
"Complexity Classes",
"Completeness",
"Polynomial Time",
"MONOTONE 1-IN-3 3SAT",
"2SET PACKING"
],
"publication_date": "2019-06-02",
"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.3237140",
"relation": "isVersionOf"
}
]
}
}
197
114
views