There is a newer version of this record available.

Preprint Open Access

QP versus NP

Frank Vega


Citation Style Language JSON Export

{
  "publisher": "Zenodo", 
  "DOI": "10.5281/zenodo.1306965", 
  "title": "QP versus NP", 
  "issued": {
    "date-parts": [
      [
        2018, 
        7, 
        6
      ]
    ]
  }, 
  "abstract": "<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>", 
  "author": [
    {
      "family": "Frank Vega"
    }
  ], 
  "type": "article", 
  "id": "1306965"
}
121
135
views
downloads
All versions This version
Views 12118
Downloads 13597
Data volume 36.7 MB26.6 MB
Unique views 9018
Unique downloads 12493

Share

Cite as