Preprint Open Access
{ "files": [ { "links": { "self": "https://zenodo.org/api/files/1fe72fb3-635c-4f02-840d-fa6ef4a7b996/manuscript.pdf" }, "checksum": "md5:26a54571e4c90a7e78c6e090d289df95", "bucket": "1fe72fb3-635c-4f02-840d-fa6ef4a7b996", "key": "manuscript.pdf", "type": "pdf", "size": 237499 } ], "owners": [ 45971 ], "doi": "10.5281/zenodo.1438785", "stats": { "version_unique_downloads": 57.0, "unique_views": 14.0, "views": 14.0, "version_views": 133.0, "unique_downloads": 8.0, "version_unique_views": 75.0, "volume": 2137491.0, "version_downloads": 88.0, "downloads": 9.0, "version_volume": 20893742.0 }, "links": { "doi": "https://doi.org/10.5281/zenodo.1438785", "conceptdoi": "https://doi.org/10.5281/zenodo.1433418", "bucket": "https://zenodo.org/api/files/1fe72fb3-635c-4f02-840d-fa6ef4a7b996", "conceptbadge": "https://zenodo.org/badge/doi/10.5281/zenodo.1433418.svg", "html": "https://zenodo.org/record/1438785", "latest_html": "https://zenodo.org/record/1441172", "badge": "https://zenodo.org/badge/doi/10.5281/zenodo.1438785.svg", "latest": "https://zenodo.org/api/records/1441172" }, "conceptdoi": "10.5281/zenodo.1433418", "created": "2018-09-29T11:15:51.146181+00:00", "updated": "2020-01-20T17:44:46.425164+00:00", "conceptrecid": "1433418", "revision": 7, "id": 1438785, "metadata": { "access_right_category": "success", "doi": "10.5281/zenodo.1438785", "description": "<pre>UP versus NP\n\nP 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 UP. Whether UP = NP is another fundamental question that it is as important as it is unresolved. To attack the UP = NP question the concept of NP-completeness is very useful. If any single NP-complete problem is in UP, then UP = NP. Quadratic Congruences is a well-known NP-complete problem. We prove Quadratic Congruences is also in UP. In this way, we demonstrate that UP = NP.</pre>", "license": { "id": "CC-BY-4.0" }, "title": "UP versus NP", "relations": { "version": [ { "count": 7, "index": 3, "parent": { "pid_type": "recid", "pid_value": "1433418" }, "is_last": false, "last_child": { "pid_type": "recid", "pid_value": "1441172" } } ] }, "keywords": [ "Polynomial Time", "UP", "NP", "Quadratic Congruences", "NP-complete" ], "publication_date": "2018-09-23", "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.1433418", "relation": "isVersionOf" } ] } }
All versions | This version | |
---|---|---|
Views | 133 | 14 |
Downloads | 88 | 9 |
Data volume | 20.9 MB | 2.1 MB |
Unique views | 75 | 14 |
Unique downloads | 57 | 8 |