Preprint Open Access
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 is a well-known NP-complete problem. We prove Quadratic Congruences is also in UP. In this way, we demonstrate that UP = NP.
Name | Size | |
---|---|---|
manuscript.pdf
md5:26a54571e4c90a7e78c6e090d289df95 |
237.5 kB | Download |
All versions | This version | |
---|---|---|
Views | 133 | 14 |
Downloads | 91 | 9 |
Data volume | 21.6 MB | 2.1 MB |
Unique views | 75 | 14 |
Unique downloads | 60 | 8 |