There is a newer version of this record available.

Preprint Open Access

QP versus NP

Frank Vega


JSON-LD (schema.org) Export

{
  "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": "http://creativecommons.org/licenses/by/4.0/legalcode", 
  "creator": [
    {
      "affiliation": "Joysonic", 
      "@id": "https://orcid.org/0000-0001-8210-4126", 
      "@type": "Person", 
      "name": "Frank Vega"
    }
  ], 
  "headline": "QP versus NP", 
  "image": "https://zenodo.org/static/img/logos/zenodo-gradient-round.svg", 
  "datePublished": "2018-07-06", 
  "url": "https://zenodo.org/record/1306965", 
  "keywords": [
    "Complexity Classes", 
    "Completeness", 
    "Logarithmic Space", 
    "Nondeterministic", 
    "XOR 2SAT"
  ], 
  "@context": "https://schema.org/", 
  "identifier": "https://doi.org/10.5281/zenodo.1306965", 
  "@id": "https://doi.org/10.5281/zenodo.1306965", 
  "@type": "ScholarlyArticle", 
  "name": "QP versus NP"
}
100
39
views
downloads
All versions This version
Views 10013
Downloads 3919
Data volume 10.5 MB5.2 MB
Unique views 6913
Unique downloads 3219

Share

Cite as