There is a newer version of this record available.

Preprint Open Access

P vs 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? We obtain a contradiction taking as assumption that P = NP. Therefore, we prove P is not equal to NP by reduction ad absurdum.

Files (222.1 kB)
Name Size
manuscript.pdf
md5:d2e0e4a2ce60a420dafc348122c0645b
222.1 kB Download
132
58
views
downloads
All versions This version
Views 13219
Downloads 5811
Data volume 13.0 MB2.4 MB
Unique views 9218
Unique downloads 348

Share

Cite as