Planar 3-SAT with a clause/variable cycle

Alexander Pilz*

*Korrespondierende/r Autor/in für diese Arbeit

Publikation: Beitrag in Buch/Bericht/KonferenzbandBeitrag in einem Konferenzband


In the Planar 3-SAT problem, we are given a 3-SAT formula together with its incidence graph, which is planar, and are asked whether this formula is satisfiable. Since Lichtenstein’s proof that this problem is NP-complete, it has been used as a starting point for a large number of reductions. In the course of this research, di erent restrictions on the incidence graph of the formula have been devised, for which the problem also remains hard. In this paper, we investigate the restriction in which we require that the incidence graph is augmented by the edges of a Hamiltonian cycle that first passes through all variables and then through all clauses, in a way that the resulting graph is still planar. We show that the problem of deciding satisfiability of a 3-SAT formula remains NP-complete even if the incidence graph is restricted in that way and the Hamiltonian cycle is given. This complements previous results demanding cycles only through either the variables or clauses. The problem remains hard for monotone formulas and instances with exactly three distinct variables per clause. In the course of this investigation, we show that monotone instances of Planar 3-SAT with three distinct variables per clause are always satisfiable, thus settling the question by Darmann, Döcker, and Dorn on the complexity of this problem variant in a surprising way.

Titel16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018
Herausgeber (Verlag)Schloss Dagstuhl, Leibniz-Zentrum fü Informatik GmbH
ISBN (elektronisch)9783959770682
PublikationsstatusVeröffentlicht - 1 Jun 2018
Extern publiziertJa
Veranstaltung16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018 - Malmo, Schweden
Dauer: 18 Jun 201820 Jun 2018


Konferenz16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018

ASJC Scopus subject areas

  • Software

Fingerprint Untersuchen Sie die Forschungsthemen von „Planar 3-SAT with a clause/variable cycle“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren