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 (282.0 kB)
Name Size
manuscript.pdf
md5:b0f372874d30375022048b9c6d14c71c
282.0 kB Download
125
91
views
downloads
All versions This version
Views 12527
Downloads 9114
Data volume 25.5 MB3.9 MB
Unique views 8726
Unique downloads 3710

Share

Cite as