1323808
doi
10.5281/zenodo.1323808
oai:zenodo.org:1323808
P versus NP
Frank Vega
Joysonic
info:eu-repo/semantics/openAccess
Creative Commons Attribution 4.0 International
https://creativecommons.org/licenses/by/4.0/legalcode
Complexity classes
Completeness
Polynomial time
Boolean formula
<p>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.</p>
Report submitted to a peer-reviewed process
Zenodo
2018-07-30
info:eu-repo/semantics/report
1323807
1579527787.388241
273865
md5:92c1895e6e8e4468a5bdc9c993dbc93c
https://zenodo.org/records/1323808/files/manuscript.pdf
public
10.5281/zenodo.1323807
isVersionOf
doi