The P =? NP solution

Frank Vega (1)

1 Datys

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.

Mots clés: P; NP; Turing machine; POLYLOGTIME; NLOGTIME; Maximum

Domaines: Complexité [cs.CC]

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