There is a newer version of this record available.

Preprint Open Access

QP versus NP

Frank Vega


JSON Export

{
  "files": [
    {
      "links": {
        "self": "https://zenodo.org/api/files/fb58875f-1cb3-4e66-ac64-1c741726ecb8/manuscript.pdf"
      }, 
      "checksum": "md5:0761c791ca81d1d8c74afee2e7ea5eaa", 
      "bucket": "fb58875f-1cb3-4e66-ac64-1c741726ecb8", 
      "key": "manuscript.pdf", 
      "type": "pdf", 
      "size": 274642
    }
  ], 
  "owners": [
    45971
  ], 
  "doi": "10.5281/zenodo.1306965", 
  "stats": {
    "version_unique_downloads": 106.0, 
    "unique_views": 18.0, 
    "views": 18.0, 
    "version_views": 121.0, 
    "unique_downloads": 76.0, 
    "version_unique_views": 90.0, 
    "volume": 21422076.0, 
    "version_downloads": 115.0, 
    "downloads": 78.0, 
    "version_volume": 31172692.0
  }, 
  "links": {
    "doi": "https://doi.org/10.5281/zenodo.1306965", 
    "conceptdoi": "https://doi.org/10.5281/zenodo.1306795", 
    "bucket": "https://zenodo.org/api/files/fb58875f-1cb3-4e66-ac64-1c741726ecb8", 
    "conceptbadge": "https://zenodo.org/badge/doi/10.5281/zenodo.1306795.svg", 
    "html": "https://zenodo.org/record/1306965", 
    "latest_html": "https://zenodo.org/record/1306970", 
    "badge": "https://zenodo.org/badge/doi/10.5281/zenodo.1306965.svg", 
    "latest": "https://zenodo.org/api/records/1306970"
  }, 
  "conceptdoi": "10.5281/zenodo.1306795", 
  "created": "2018-07-06T21:21:15.037723+00:00", 
  "updated": "2020-01-20T16:46:03.309912+00:00", 
  "conceptrecid": "1306795", 
  "revision": 5, 
  "id": 1306965, 
  "metadata": {
    "access_right_category": "success", 
    "doi": "10.5281/zenodo.1306965", 
    "description": "<p>Given an instance of $\\textit{XOR 2SAT}$ and a positive integer $2^{K}$, the problem exponential exclusive-or 2-satisfiability consists in deciding whether this Boolean formula has a truth assignment with at leat $K$ satisfiable clauses. We prove exponential exclusive-or 2-satisfiability is in $QP$ and $\\textit{NP-complete}$. In this way, we show $QP \\subseteq NP$.</p>", 
    "license": {
      "id": "CC-BY-4.0"
    }, 
    "title": "QP versus NP", 
    "relations": {
      "version": [
        {
          "count": 5, 
          "index": 3, 
          "parent": {
            "pid_type": "recid", 
            "pid_value": "1306795"
          }, 
          "is_last": false, 
          "last_child": {
            "pid_type": "recid", 
            "pid_value": "1306970"
          }
        }
      ]
    }, 
    "keywords": [
      "Complexity Classes", 
      "Completeness", 
      "Logarithmic Space", 
      "Nondeterministic", 
      "XOR 2SAT"
    ], 
    "publication_date": "2018-07-06", 
    "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.1306795", 
        "relation": "isVersionOf"
      }
    ]
  }
}
121
115
views
downloads
All versions This version
Views 12118
Downloads 11578
Data volume 31.2 MB21.4 MB
Unique views 9018
Unique downloads 10676

Share

Cite as