There is a newer version of this record available.

Preprint Open Access

On P versus NP

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 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 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. We prove there is a problem in coNP that is not in P. In this way, we show that P is not equal to coNP. Since P = NP implies P = coNP, then we also demonstrate that P is not equal to NP.</dc:description>
  <dc:description>Archived previous version in</dc:description>
  <dc:subject>Boolean circuit</dc:subject>
  <dc:title>On P versus NP</dc:title>
All versions This version
Views 1,00348
Downloads 50924
Data volume 96.4 MB3.9 MB
Unique views 82245
Unique downloads 40522


Cite as