Preprint Open Access
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.
Name | Size | |
---|---|---|
manuscript.pdf
md5:f95e57a4bfcc0fedb5ce195956447e98 |
246.9 kB | Download |
All versions | This version | |
---|---|---|
Views | 133 | 17 |
Downloads | 224 | 6 |
Data volume | 61.1 MB | 1.5 MB |
Unique views | 97 | 17 |
Unique downloads | 210 | 6 |