There is a newer version of this record available.

Preprint Open Access

UP versus NP


Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="" xmlns:oai_dc="" xmlns:xsi="" xsi:schemaLocation="">
  <dc:description>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.</dc:description>
  <dc:subject>Quadratic Congruences</dc:subject>
  <dc:title>UP versus NP</dc:title>
All versions This version
Views 8428
Downloads 6223
Data volume 10.9 MB1.9 MB
Unique views 5627
Unique downloads 4720


Cite as