Planar 3-SAT with a Clause/Variable Cycle

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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete mathematics and theoretical computer science Jg. 21 no. 3; H. Discrete Algorithms
1. Verfasser:	Pilz, Alexander
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Discrete Mathematics & Theoretical Computer Science 05.06.2019
Schlagworte:	computer science - computational complexity computer science - computational geometry
ISSN:	1365-8050, 1365-8050
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!