Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

The P =? NP solution

Frank Vega 1
Abstract : 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. Since then, many computer scientists have believed the most probable answer is that P is different to NP. A key reason for this belief is the possible solution of P=NP would imply many startling results that are believed to be false. We prove the belief of almost all computer scientists was a truly supposition.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download
Contributor : Frank Vega <>
Submitted on : Monday, April 6, 2015 - 6:02:35 PM
Last modification on : Tuesday, April 7, 2015 - 2:46:15 PM
Long-term archiving on: : Tuesday, July 7, 2015 - 10:06:13 AM


Files produced by the author(s)


  • HAL Id : hal-01139624, version 1


Frank Vega. The P =? NP solution. 2015. ⟨hal-01139624⟩



Record views


Files downloads