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
Type de document :
Pré-publication, Document de travail
Preprint submitted to Theoretical Computer Science. 2016
Liste complète des métadonnées

Littérature citée [8 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01270398
Contributeur : Frank Vega <>
Soumis le : dimanche 7 février 2016 - 17:43:19
Dernière modification le : mardi 9 février 2016 - 15:00:37
Document(s) archivé(s) le : samedi 12 novembre 2016 - 11:41:52

Fichier

Is-P-equal-to-NP (1).pdf
Fichiers produits par l'(les) auteur(s)

Licence


Domaine public

Identifiants

  • HAL Id : hal-01270398, version 1

Citation

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

Partager

Métriques

Consultations de
la notice

434

Téléchargements du document

304