1306796
doi
10.5281/zenodo.1306796
oai:zenodo.org:1306796
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
exclusive-or 2-satisfiability
<p>Given an instance of exclusive-or 2-satisfiability and a positive integer K, the problem maximum exclusive-or 2-satisfiability consists in deciding whether this Boolean formula has a truth assignment with at leat K satisfiable clauses. We prove that maximum exclusive-or 2-satisfiability is in QP. Moreover, we demonstrate this problem is NP-complete. In this way, we show QP contains NP.</p>
Zenodo
2018-07-06
info:eu-repo/semantics/preprint
1306795
1579538839.513444
246849
md5:49e04a1c10dda7019157a105b3804da5
https://zenodo.org/records/1306796/files/manuscript.pdf
public
10.5281/zenodo.1306795
isVersionOf
doi