There is a newer version of this record available.

Preprint Open Access

Sparse complete sets for coNP: Solution of the P versus NP problem

Frank Vega

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="" xmlns:oai_dc="" xmlns:xsi="" xsi:schemaLocation="">
  <dc:creator>Frank Vega</dc:creator>
  <dc:description>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 demonstrate the complexity class P is equal to NP.</dc:description>
  <dc:subject>Complexity Classes</dc:subject>
  <dc:subject>Complement Language</dc:subject>
  <dc:subject>Polynomial Time</dc:subject>
  <dc:title>Sparse complete sets for coNP: Solution of the P versus NP problem</dc:title>
All versions This version
Views 12639
Downloads 8628
Data volume 22.6 MB3.1 MB
Unique views 9636
Unique downloads 6123


Cite as