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.9 kB)
Name Size
manuscript.pdf
md5:f95e57a4bfcc0fedb5ce195956447e98
246.9 kB Download
121
115
views
downloads
All versions This version
Views 12115
Downloads 1155
Data volume 31.2 MB1.2 MB
Unique views 9015
Unique downloads 1065

Share

Cite as