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