There is a newer version of this record available.

Preprint Open Access

QP versus NP

Frank Vega


Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Frank Vega</dc:creator>
  <dc:date>2018-07-06</dc:date>
  <dc:description>Given an instance of $\textit{XOR 2SAT}$ and a positive integer $2^{K}$, the problem exponential exclusive-or 2-satisfiability consists in deciding whether this Boolean formula has a truth assignment with at leat $K$ satisfiable clauses. We prove exponential exclusive-or 2-satisfiability is in $QP$ and $\textit{NP-complete}$. In this way, we show $QP \subseteq NP$.</dc:description>
  <dc:identifier>https://zenodo.org/record/1306965</dc:identifier>
  <dc:identifier>10.5281/zenodo.1306965</dc:identifier>
  <dc:identifier>oai:zenodo.org:1306965</dc:identifier>
  <dc:relation>doi:10.5281/zenodo.1306795</dc:relation>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>http://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
  <dc:subject>Complexity Classes</dc:subject>
  <dc:subject>Completeness</dc:subject>
  <dc:subject>Logarithmic Space</dc:subject>
  <dc:subject>Nondeterministic</dc:subject>
  <dc:subject>XOR 2SAT</dc:subject>
  <dc:title>QP versus NP</dc:title>
  <dc:type>info:eu-repo/semantics/preprint</dc:type>
  <dc:type>publication-preprint</dc:type>
</oai_dc:dc>
103
39
views
downloads
All versions This version
Views 10315
Downloads 3919
Data volume 10.5 MB5.2 MB
Unique views 7215
Unique downloads 3219

Share

Cite as