There is a newer version of this record available.

Preprint Open Access

UP versus NP

Frank


JSON-LD (schema.org) Export

{
  "description": "<p>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.</p>", 
  "license": "http://creativecommons.org/licenses/by/4.0/legalcode", 
  "creator": [
    {
      "affiliation": "Joysonic", 
      "@type": "Person", 
      "name": "Frank"
    }
  ], 
  "headline": "UP versus NP", 
  "image": "https://zenodo.org/static/img/logos/zenodo-gradient-round.svg", 
  "datePublished": "2018-09-16", 
  "url": "https://zenodo.org/record/1419750", 
  "keywords": [
    "P", 
    "NP", 
    "UP", 
    "NP-conplete", 
    "Quadratic Congruences"
  ], 
  "@context": "https://schema.org/", 
  "identifier": "https://doi.org/10.5281/zenodo.1419750", 
  "@id": "https://doi.org/10.5281/zenodo.1419750", 
  "@type": "ScholarlyArticle", 
  "name": "UP versus NP"
}
73
51
views
downloads
All versions This version
Views 7324
Downloads 5120
Data volume 8.8 MB1.7 MB
Unique views 4623
Unique downloads 3617

Share

Cite as