Preprint Open Access

QP versus NP

Frank Vega

Citation Style Language JSON Export

{
"publisher": "Zenodo",
"DOI": "10.5281/zenodo.1306970",
"author": [
{
"family": "Frank Vega"
}
],
"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>",
"title": "QP versus NP",
"type": "article",
"id": "1306970"
}
125
184
views