publication . Preprint . Other literature type . 2019

On P versus NP

Vega, Frank;
Open Access
  • Published: 10 Mar 2019
Abstract
P versus NP is considered as one of the great open problems of science. This consists in knowing the answer of the following question: Is P equal to NP? This problem was first mentioned in a letter written by John Nash to the National Security Agency in 1955. However, a precise statement of the P versus NP problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this huge problem have failed. Another major complexity class is coNP. Whether NP = coNP is another fundamental question that it is as important as it is unresolved. To attack the P versus NP problem, the concept of coNP-completeness is very ...
Subjects
free text keywords: P, NP, coNP, coNP-complete, Minimum, Boolean circuit
Download fromView all 5 versions
ZENODO
Preprint . 2019
Provider: ZENODO
ZENODO
Preprint . 2019
Provider: ZENODO
ZENODO
Preprint . 2019
Provider: ZENODO
ZENODO
Preprint . 2019
Provider: ZENODO
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue