Proposal 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? It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute. This question was first mentioned in a letter written by John Nash to the National Security Agency in 1955. 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 versus NP question the concept of NP-completeness has been very useful. If any single NP-complete problem can be solved in polynomial time, then every NP problem has a polynomial time algorithm. Quadratic Congruences is a known NP-complete problem. We prove Quadratic Congruences is in P. In this way, we demonstrate the P versus NP problem.

Proposal submitted to Information Processing Letters and Highlights 2018
Files (921.7 kB)
Name Size
paper.pdf
md5:5539a750007f675fea8fedbce5b217f9
382.2 kB Download
presentation.pdf
md5:2c4aedcd4f64d2bfaf077d2eac4150c2
539.5 kB Download
53
7
views
downloads
All versions This version
Views 5353
Downloads 77
Data volume 3.0 MB3.0 MB
Unique views 5252
Unique downloads 77

Share

Cite as