Preprint Open Access

UP versus NP

Frank Vega

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.

Files (237.3 kB)
Name Size
manuscript.pdf
md5:70806ca0b838a16a09a1c8bf048478ce
237.3 kB Download
104
65
views
downloads
All versions This version
Views 10418
Downloads 6513
Data volume 15.4 MB3.1 MB
Unique views 5317
Unique downloads 3412

Share

Cite as