There is a newer version of this record available.

Preprint Open Access

P versus NP

Frank Vega

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. 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.

Files (256.0 kB)
Name Size
manuscript.pdf
md5:3498ab212f13ec29def65aaec459724c
256.0 kB Download
149
95
views
downloads
All versions This version
Views 14916
Downloads 9511
Data volume 24.3 MB2.8 MB
Unique views 10014
Unique downloads 659

Share

Cite as