Is P equal to NP?

Frank Vega 1
Abstract : P versus NP is one of the most important and unsolved problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? This incognita was first mentioned in a letter written by Kurt Gödel to John von Neumann in 1956. However, the precise statement of the P versus NP problem was introduced in 1971 by Stephen Cook in a seminal paper. Under the assumption of P = NP, we show that P = EXP is also hold. Since P is not equal to EXP, we prove that P is not equal to NP by the Reductio ad absurdum rule.
Keywords : P NP EXP NEXP coNP
Document type :
Preprints, Working Papers, ...
Liste complète des métadonnées

Cited literature [8 references]  Display  Hide  Download
Contributor : Frank Vega <>
Submitted on : Sunday, February 7, 2016 - 5:43:19 PM
Last modification on : Tuesday, February 9, 2016 - 3:00:37 PM
Document(s) archivé(s) le : Saturday, November 12, 2016 - 11:41:52 AM


Is-P-equal-to-NP (1).pdf
Files produced by the author(s)


Public Domain


  • HAL Id : hal-01270398, version 1


Frank Vega. Is P equal to NP?. Preprint submitted to Theoretical Computer Science. 2016. 〈hal-01270398〉



Record views


Files downloads