publication . Preprint . Other literature type . 2018

UP versus NP

Vega, Frank;
Open Access
  • Published: 23 Sep 2018
Abstract
<pre>UP versus NP 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 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...
Subjects
free text keywords: Polynomial Time, UP, NP, Quadratic Congruences, NP-complete
Download fromView all 2 versions
ZENODO
Preprint . 2018
Provider: ZENODO
Zenodo
Other literature type . 2018
Provider: Datacite
Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue
publication . Preprint . Other literature type . 2018

UP versus NP

Vega, Frank;