publication . Other literature type . Preprint . 2018

Sparse Complete Sets For Conp: Solution Of The P Versus Np Problem

Vega, Frank;
Open Access
  • Published: 17 Sep 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? 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. Another major complexity class is coNP. Whether NP = coNP is another fundamental question that it is as important as it is unresolved. In 1979, Fortune showed that if any sparse language is coNP-complete, then P = NP. We prove there is a possible sparse language in coNP-complete. In this way, we demonstra...
Subjects
free text keywords: Complexity Classes, Sparse, Complement Language, Completeness, Polynomial Time
Zenodo
Other literature type . 2018
Provider: Datacite
Zenodo
Other literature type . 2019
Provider: Datacite
ZENODO
Preprint . 2018
Provider: ZENODO
ZENODO
Preprint . 2019
Provider: ZENODO
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue