UP VERSUS NP
Résumé
We define a problem that we call General Quadratic Congruences. We show General Quadratic Congruences is an NP-complete problem. Moreover , we prove General Quadratic Congruences is also in UP. In this way, we demonstrate that UP = NP.
Domaines
Complexité [cs.CC]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...