1 Hit in 0.062 sec

P Versus Np

Frank Vega
2018 Zenodo  
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. To attack the P = NP question the concept of NP-completeness is very useful. If any single NP-complete problem is in P, then P = NP.
more » ... P, then P = NP. Quadratic Congruences is a well-known NP-complete problem. We prove Quadratic Congruences is also in P. In this way, we demonstrate that P = NP.
doi:10.5281/zenodo.1438784 fatcat:ebvprjh3dneyplykr3aen6bgfy