There is a newer version of this record available.

Preprint Open Access

# UP versus NP

Frank Vega

### JSON-LD (schema.org) Export

{
"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>",
"creator": [
{
"affiliation": "Joysonic",
"@id": "https://orcid.org/0000-0001-8210-4126",
"@type": "Person",
"name": "Frank Vega"
}
],
"datePublished": "2018-09-23",
"url": "https://zenodo.org/record/1438821",
"keywords": [
"Polynomial Time",
"UP",
"NP",
"NP-complete"
],
"@context": "https://schema.org/",
"identifier": "https://doi.org/10.5281/zenodo.1438821",
"@id": "https://doi.org/10.5281/zenodo.1438821",
"@type": "ScholarlyArticle",
"name": "UP versus NP"
}
133
88
views