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

Celý popis

Podrobná bibliografie

Vydáno v:	Discrete mathematics and theoretical computer science Ročník 21 no. 3; číslo Discrete Algorithms
Hlavní autor:	Pilz, Alexander
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Discrete Mathematics & Theoretical Computer Science 05.06.2019
Témata:	computer science - computational complexity computer science - computational geometry
ISSN:	1365-8050, 1365-8050
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!