Is P equal to NP? - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Is P equal to NP?

Frank Vega
  • Function : Author


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.


Fichier principal
Vignette du fichier
Is-P-equal-to-NP (1).pdf (93.07 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01270398 , version 1 (07-02-2016)


Public Domain


  • HAL Id : hal-01270398 , version 1


Frank Vega. Is P equal to NP?. 2016. ⟨hal-01270398⟩
840 View
812 Download


Gmail Facebook Twitter LinkedIn More