10.5281/zenodo.1312908
https://zenodo.org/records/1312908
oai:zenodo.org:1312908
Frank Vega
Frank Vega
0000-0001-8210-4126
Joysonic
P vs NP
Zenodo
2018
Complexity classes
Completeness
Polynomial time
Graph
Circuit
2018-07-16
10.5281/zenodo.1312907
Creative Commons Attribution 4.0 International
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.