1306970
doi
10.5281/zenodo.1306970
oai:zenodo.org:1306970
QP versus NP
Frank Vega
Joysonic
info:eu-repo/semantics/openAccess
Creative Commons Attribution 4.0 International
https://creativecommons.org/licenses/by/4.0/legalcode
Complexity Classes
Completeness
Logarithmic Space
Nondeterministic
XOR 2SAT
<p>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$.</p>
Zenodo
2018-07-06
info:eu-repo/semantics/preprint
1306795
1579538772.395519
274670
md5:d58beddab9023ae62024e0be81655f8e
https://zenodo.org/records/1306970/files/manuscript.pdf
public
10.5281/zenodo.1306795
isVersionOf
doi