Preprint Open Access

# On P versus NP

Frank Vega

### Citation Style Language JSON Export

{
"publisher": "Zenodo",
"DOI": "10.5281/zenodo.2598772",
"title": "On P versus NP",
"issued": {
"date-parts": [
[
2019,
3,
19
]
]
},
"abstract": "<p>P versus NP is considered as one of the great open problems of science. This consists in knowing the answer of the following question: Is P equal to NP? This problem was first mentioned in a letter written by John Nash to the National Security Agency in 1955. However, a precise statement of the P versus NP problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. Another major complexity class is coNP. Whether NP = coNP is another fundamental question that it is as important as it is unresolved. We prove there is a problem in coNP that is not in P. In this way, we show that P is not equal to coNP. Since P = NP implies P = coNP, then we also demonstrate that P is not equal to NP.</p>",
"author": [
{
"family": "Frank Vega"
}
],
"note": "Archived previous version in https://hal.archives-ouvertes.fr/hal-01509423",
"type": "article",
"id": "2598772"
}
1,023
525
views