Preprint Open Access
Frank Vega
{ "files": [ { "links": { "self": "https://zenodo.org/api/files/db0801a9-e0ba-44a3-bc05-ae9c7e1028cf/paper.pdf" }, "checksum": "md5:4d3cb3fa000623667d48b7151b6c4a9c", "bucket": "db0801a9-e0ba-44a3-bc05-ae9c7e1028cf", "key": "paper.pdf", "type": "pdf", "size": 398330 } ], "owners": [ 45971 ], "doi": "10.5281/zenodo.1285952", "stats": { "version_unique_downloads": 51.0, "unique_views": 27.0, "views": 31.0, "version_views": 96.0, "unique_downloads": 15.0, "version_unique_views": 88.0, "volume": 6373280.0, "version_downloads": 54.0, "downloads": 16.0, "version_volume": 21514152.0 }, "links": { "doi": "https://doi.org/10.5281/zenodo.1285952", "conceptdoi": "https://doi.org/10.5281/zenodo.1285951", "bucket": "https://zenodo.org/api/files/db0801a9-e0ba-44a3-bc05-ae9c7e1028cf", "conceptbadge": "https://zenodo.org/badge/doi/10.5281/zenodo.1285951.svg", "html": "https://zenodo.org/record/1285952", "latest_html": "https://zenodo.org/record/1286204", "badge": "https://zenodo.org/badge/doi/10.5281/zenodo.1285952.svg", "latest": "https://zenodo.org/api/records/1286204" }, "conceptdoi": "10.5281/zenodo.1285951", "created": "2018-06-08T18:47:26.246166+00:00", "updated": "2020-01-20T17:30:09.764910+00:00", "conceptrecid": "1285951", "revision": 5, "id": 1285952, "metadata": { "access_right_category": "success", "doi": "10.5281/zenodo.1285952", "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": 0, "parent": { "pid_type": "recid", "pid_value": "1285951" }, "is_last": false, "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" } ] } }
All versions | This version | |
---|---|---|
Views | 96 | 31 |
Downloads | 54 | 16 |
Data volume | 21.5 MB | 6.4 MB |
Unique views | 88 | 27 |
Unique downloads | 51 | 15 |