Solution of P versus NP Problem - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2015

Solution of P versus NP Problem

Frank Vega
  • Function : Author


The P versus NP problem 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. We consider a new complexity class, called equivalent-P, which has a close relation with this problem. The class equivalent-P has those languages that contain ordered pairs of instances, where each one belongs to a specific problem in P, such that the two instances share a same solution, that is, the same certificate. We demonstrate that equivalent-P = NP and equivalent-P = P. In this way, we find the solution of P versus NP problem, that is, P = NP.
Fichier principal
Vignette du fichier
Preprint_of_P_versus_NP_Problem.pdf (174.85 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01161668 , version 1 (08-06-2015)


  • HAL Id : hal-01161668 , version 1


Frank Vega. Solution of P versus NP Problem. 2015. ⟨hal-01161668⟩
865 View
1415 Download


Gmail Facebook X LinkedIn More