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

Full description

Bibliographic Details

Published in:	Discrete mathematics and theoretical computer science Vol. 21 no. 3; no. Discrete Algorithms
Main Author:	Pilz, Alexander
Format:	Journal Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 05.06.2019
Subjects:	computer science - computational complexity computer science - computational geometry
ISSN:	1365-8050, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!