Published July 6, 2018
| Version v5
Preprint
Open
QP versus NP
Description
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
manuscript.pdf
Files
(274.7 kB)
Name | Size | Download all |
---|---|---|
md5:d58beddab9023ae62024e0be81655f8e
|
274.7 kB | Preview Download |