There is a newer version of this record available.

Preprint Open Access

QP versus NP

Frank Vega

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 (246.8 kB)
Name Size
manuscript.pdf
md5:49e04a1c10dda7019157a105b3804da5
246.8 kB Download
109
39
views
downloads
All versions This version
Views 10930
Downloads 393
Data volume 10.5 MB740.5 kB
Unique views 7829
Unique downloads 323

Share

Cite as