{ "access": { "embargo": { "active": false, "reason": null }, "files": "public", "record": "public", "status": "open" }, "created": "2019-06-05T18:24:29.121059+00:00", "custom_fields": {}, "deletion_status": { "is_deleted": false, "status": "P" }, "files": { "count": 1, "enabled": true, "entries": { "manuscript.pdf": { "checksum": "md5:ae0aa36585e165e638c39d82f931d41d", "ext": "pdf", "id": "8293ad59-5dd1-4d5e-82dd-3f6c21a68d8f", "key": "manuscript.pdf", "metadata": null, "mimetype": "application/pdf", "size": 254052 } }, "order": [], "total_bytes": 254052 }, "id": "3239476", "is_draft": false, "is_published": true, "links": { "access": "https://zenodo.org/api/records/3239476/access", "access_links": "https://zenodo.org/api/records/3239476/access/links", "access_request": "https://zenodo.org/api/records/3239476/access/request", "access_users": "https://zenodo.org/api/records/3239476/access/users", "archive": "https://zenodo.org/api/records/3239476/files-archive", "archive_media": "https://zenodo.org/api/records/3239476/media-files-archive", "communities": "https://zenodo.org/api/records/3239476/communities", "communities-suggestions": "https://zenodo.org/api/records/3239476/communities-suggestions", "doi": "https://doi.org/10.5281/zenodo.3239476", "draft": "https://zenodo.org/api/records/3239476/draft", "files": "https://zenodo.org/api/records/3239476/files", "latest": "https://zenodo.org/api/records/3239476/versions/latest", "latest_html": "https://zenodo.org/records/3239476/latest", "media_files": "https://zenodo.org/api/records/3239476/media-files", "parent": "https://zenodo.org/api/records/3237140", "parent_doi": "https://zenodo.org/doi/10.5281/zenodo.3237140", "parent_html": "https://zenodo.org/records/3237140", "requests": "https://zenodo.org/api/records/3239476/requests", "reserve_doi": "https://zenodo.org/api/records/3239476/draft/pids/doi", "self": "https://zenodo.org/api/records/3239476", "self_doi": "https://zenodo.org/doi/10.5281/zenodo.3239476", "self_html": "https://zenodo.org/records/3239476", "self_iiif_manifest": "https://zenodo.org/api/iiif/record:3239476/manifest", "self_iiif_sequence": "https://zenodo.org/api/iiif/record:3239476/sequence/default", "versions": "https://zenodo.org/api/records/3239476/versions" }, "media_files": { "count": 0, "enabled": false, "entries": {}, "order": [], "total_bytes": 0 }, "metadata": { "creators": [ { "affiliations": [ { "name": "Joysonic" } ], "person_or_org": { "family_name": "Frank Vega", "identifiers": [ { "identifier": "0000-0001-8210-4126", "scheme": "orcid" } ], "name": "Frank Vega", "type": "personal" } } ], "description": "
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.
", "publication_date": "2019-06-02", "publisher": "Zenodo", "resource_type": { "id": "publication-preprint", "title": { "de": "Preprint", "en": "Preprint" } }, "rights": [ { "description": { "en": "The Creative Commons Attribution license allows re-distribution and re-use of a licensed work on the condition that the creator is appropriately credited." }, "icon": "cc-by-icon", "id": "cc-by-4.0", "props": { "scheme": "spdx", "url": "https://creativecommons.org/licenses/by/4.0/legalcode" }, "title": { "en": "Creative Commons Attribution 4.0 International" } } ], "subjects": [ { "subject": "Complexity Classes" }, { "subject": "Completeness" }, { "subject": "Polynomial Time" }, { "subject": "MONOTONE 1-IN-3 3SAT" }, { "subject": "2SET PACKING" } ], "title": "The P versus NP Problem" }, "parent": { "access": { "owned_by": { "user": 45971 } }, "communities": {}, "id": "3237140", "pids": { "doi": { "client": "datacite", "identifier": "10.5281/zenodo.3237140", "provider": "datacite" } } }, "pids": { "doi": { "client": "datacite", "identifier": "10.5281/zenodo.3239476", "provider": "datacite" }, "oai": { "identifier": "oai:zenodo.org:3239476", "provider": "oai" } }, "revision_id": 5, "stats": { "all_versions": { "data_volume": 54242947.0, "downloads": 213, "unique_downloads": 201, "unique_views": 480, "views": 497 }, "this_version": { "data_volume": 5843196.0, "downloads": 23, "unique_downloads": 22, "unique_views": 33, "views": 34 } }, "status": "published", "updated": "2020-01-20T17:34:04.268661+00:00", "versions": { "index": 4, "is_latest": false } }