There is a newer version of this record available.

Preprint Open Access

QP versus NP

Frank Vega

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$.

Files (274.6 kB)
Name Size
manuscript.pdf
md5:0761c791ca81d1d8c74afee2e7ea5eaa
274.6 kB Download
121
149
views
downloads
All versions This version
Views 12118
Downloads 149109
Data volume 40.5 MB29.9 MB
Unique views 9018
Unique downloads 136103

Share

Cite as