10.5281/zenodo.1306970
https://zenodo.org/records/1306970
oai:zenodo.org:1306970
Frank Vega
Frank Vega
0000-0001-8210-4126
Joysonic
QP versus NP
Zenodo
2018
Complexity Classes
Completeness
Logarithmic Space
Nondeterministic
XOR 2SAT
2018-07-06
10.5281/zenodo.1306795
Creative Commons Attribution 4.0 International
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$.