Pré-Publication, Document De Travail Année : 2018

The P = Sharp-P Consequence

Frank Vega
  • Fonction : Auteur

Résumé

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? This question was first mentioned in a letter written by John Nash to the National Security Agency in 1955. A precise statement of the P versus NP problem was introduced independently in 1971 by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. Another major complexity classes are EXP and Sharp-P. Whether Sharp-P = P is another fundamental question that it is as important as it is unresolved. However, we already know that P is not equal to EXP. We prove if Sharp-P = P, then we can determine in polynomial time which subsets could be solved in a feasible polynomial time from every EXP language.

Fichier principal
Vignette du fichier
manuscript.pdf (592.13 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-01706184 , version 1 (10-02-2018)

Licence

Identifiants

  • HAL Id : hal-01706184 , version 1

Citer

Frank Vega. The P = Sharp-P Consequence. 2018. ⟨hal-01706184⟩
108 Consultations
798 Téléchargements

Partager

  • More