Published July 6, 2018
| Version v1
Preprint
Open
QP versus NP
Description
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.
Files
manuscript.pdf
Files
(246.8 kB)
Name | Size | Download all |
---|---|---|
md5:49e04a1c10dda7019157a105b3804da5
|
246.8 kB | Preview Download |