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.7 kB)
Name Size
manuscript.pdf
md5:d58beddab9023ae62024e0be81655f8e
274.7 kB Download
93
22
views
downloads
All versions This version
Views 9332
Downloads 228
Data volume 5.9 MB2.2 MB
Unique views 6531
Unique downloads 188

Share

Cite as