Preprint Open Access
UP versus NP
Frank
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:7215989d02149ae4279e0725880a7eac |
83.8 kB | Download |
| All versions | This version | |
|---|---|---|
| Views | 73 | 24 |
| Downloads | 51 | 20 |
| Data volume | 8.8 MB | 1.7 MB |
| Unique views | 46 | 23 |
| Unique downloads | 36 | 17 |
- Publication date:
- September 16, 2018
- DOI:
-
- Keyword(s):
- P NP UP NP-conplete Quadratic Congruences
- License (for files):
- Creative Commons Attribution 4.0 International