There is a newer version of this record available.

Preprint Open Access

On P versus NP

Frank Vega


JSON Export

{
  "files": [
    {
      "links": {
        "self": "https://zenodo.org/api/files/d524690b-6f7d-4642-98cb-4297219177c6/onpversusnp.pdf"
      }, 
      "checksum": "md5:7eba6134b992496838973357ba36beca", 
      "bucket": "d524690b-6f7d-4642-98cb-4297219177c6", 
      "key": "onpversusnp.pdf", 
      "type": "pdf", 
      "size": 201860
    }
  ], 
  "owners": [
    45971
  ], 
  "doi": "10.5281/zenodo.2596354", 
  "stats": {
    "version_unique_downloads": 419.0, 
    "unique_views": 119.0, 
    "views": 124.0, 
    "version_views": 1023.0, 
    "unique_downloads": 52.0, 
    "version_unique_views": 840.0, 
    "volume": 11506020.0, 
    "version_downloads": 525.0, 
    "downloads": 57.0, 
    "version_volume": 99341381.0
  }, 
  "links": {
    "doi": "https://doi.org/10.5281/zenodo.2596354", 
    "conceptdoi": "https://doi.org/10.5281/zenodo.2588891", 
    "bucket": "https://zenodo.org/api/files/d524690b-6f7d-4642-98cb-4297219177c6", 
    "conceptbadge": "https://zenodo.org/badge/doi/10.5281/zenodo.2588891.svg", 
    "html": "https://zenodo.org/record/2596354", 
    "latest_html": "https://zenodo.org/record/2598772", 
    "badge": "https://zenodo.org/badge/doi/10.5281/zenodo.2596354.svg", 
    "latest": "https://zenodo.org/api/records/2598772"
  }, 
  "conceptdoi": "10.5281/zenodo.2588891", 
  "created": "2019-03-17T03:46:56.518764+00:00", 
  "updated": "2020-01-20T17:23:01.387913+00:00", 
  "conceptrecid": "2588891", 
  "revision": 7, 
  "id": 2596354, 
  "metadata": {
    "access_right_category": "success", 
    "doi": "10.5281/zenodo.2596354", 
    "description": "<p>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 useful. We prove there is a problem in coNP-complete 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.</p>", 
    "license": {
      "id": "CC-BY-4.0"
    }, 
    "title": "On P versus NP", 
    "notes": "Archived previous version in https://hal.archives-ouvertes.fr/hal-01509423", 
    "relations": {
      "version": [
        {
          "count": 11, 
          "index": 8, 
          "parent": {
            "pid_type": "recid", 
            "pid_value": "2588891"
          }, 
          "is_last": false, 
          "last_child": {
            "pid_type": "recid", 
            "pid_value": "2598772"
          }
        }
      ]
    }, 
    "keywords": [
      "P", 
      "NP", 
      "coNP", 
      "coNP-complete", 
      "Minimum", 
      "Boolean circuit"
    ], 
    "publication_date": "2019-03-17", 
    "creators": [
      {
        "orcid": "0000-0001-8210-4126", 
        "affiliation": "Joysonic", 
        "name": "Frank Vega"
      }
    ], 
    "access_right": "open", 
    "resource_type": {
      "subtype": "preprint", 
      "type": "publication", 
      "title": "Preprint"
    }, 
    "related_identifiers": [
      {
        "scheme": "doi", 
        "identifier": "10.5281/zenodo.2588891", 
        "relation": "isVersionOf"
      }
    ]
  }
}
1,023
525
views
downloads
All versions This version
Views 1,023124
Downloads 52557
Data volume 99.3 MB11.5 MB
Unique views 840119
Unique downloads 41952

Share

Cite as