There is a newer version of this record available.

Preprint Open Access

QP versus NP

Frank Vega

Given an instance of $\textit{XOR 2SAT}$ with $m$ clauses and a positive integer $K$ given in unary, the problem majority exclusive-or 2-satisfiability consists in deciding whether this Boolean formula has a truth assignment with at leat $K$ satisfiable clauses and $K \geq \frac{2}{3} \times m$. Majority exclusive-or 2-satisfiability is in $QP$ and $NP-complete$. Thus, $QP \subseteq NP$.

Files (270.1 kB)
Name Size
manuscript.pdf
md5:113275d289457122ce7afd8c9391bfc5
270.1 kB Download
125
185
views
downloads
All versions This version
Views 12516
Downloads 1856
Data volume 50.4 MB1.6 MB
Unique views 9415
Unique downloads 1726

Share

Cite as