There is a newer version of this record available.

Report 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? 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. We prove there is a problem in NP-complete and P. Therefore, we demonstrate P = NP.

Report submitted to a peer-reviewed process
Files (273.9 kB)
Name Size
manuscript.pdf
md5:92c1895e6e8e4468a5bdc9c993dbc93c
273.9 kB Download
125
91
views
downloads
All versions This version
Views 12513
Downloads 9117
Data volume 25.5 MB4.7 MB
Unique views 8713
Unique downloads 3713

Share

Cite as