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
109
39
views
downloads
All versions This version
Views 10915
Downloads 394
Data volume 10.5 MB987.5 kB
Unique views 7815
Unique downloads 324
More info on how stats are collected.
Indexed in
Publication date:
July 6, 2018
DOI:
10.5281/zenodo.1306929

Zenodo DOI Badge

DOI 

10.5281/zenodo.1306929

Markdown 

[![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.1306929.svg)](https://doi.org/10.5281/zenodo.1306929)

reStructedText 

.. image:: https://zenodo.org/badge/DOI/10.5281/zenodo.1306929.svg
   :target: https://doi.org/10.5281/zenodo.1306929

HTML 

<a href="https://doi.org/10.5281/zenodo.1306929"><img src="https://zenodo.org/badge/DOI/10.5281/zenodo.1306929.svg" alt="DOI"></a>

Image URL 

https://zenodo.org/badge/DOI/10.5281/zenodo.1306929.svg

Target URL 

https://doi.org/10.5281/zenodo.1306929

Keyword(s):
Complexity Classes Completeness Logarithmic Space Nondeterministic exclusive-or 2-satisfiability
License (for files):
Creative Commons Attribution 4.0 International

Versions

Version 5 10.5281/zenodo.1306970 Jul 6, 2018
Version 4 10.5281/zenodo.1306965 Jul 6, 2018
Version 3 10.5281/zenodo.1306943 Jul 6, 2018
Version 2 10.5281/zenodo.1306929 Jul 6, 2018
Version 1 10.5281/zenodo.1306796 Jul 6, 2018
Cite all versions? You can cite all versions by using the DOI 10.5281/zenodo.1306795. This DOI represents all versions, and will always resolve to the latest one. Read more.

Share

Cite as

Export