publication . Other literature type . Preprint . 2018

P Vs Np

Frank Vega;
Open Access
  • Published: 08 Jun 2018
  • Publisher: Zenodo
Abstract
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? It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute. 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. To attack the P versus NP question the concept of NP-completeness has been very useful. If any single NP-...
Read more
doi: 10.5281/zenodo.1285952
Subjects
free text keywords: Complexity Classes, Completeness, Polynomial Time, 3SAT, Quadratic Residue
Download fromView all 2 versions
Zenodo
Other literature type . 2018
Provider: Datacite
ZENODO
Preprint . 2018
Provider: ZENODO
Zenodo
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue