planar 3-SAT

GPTKB entity

Statements (19)
Predicate Object
gptkbp:instanceOf theoretical computer science
NP-complete problem
gptkbp:citation gptkb:Lichtenstein,_D._(1982)._Planar_formulae_and_their_uses._SIAM_J._Comput.
gptkbp:definedIn Boolean formulas in conjunctive normal form
https://www.w3.org/2000/01/rdf-schema#label planar 3-SAT
gptkbp:introduced gptkb:Michael_Sipser
gptkb:David_Lichtenstein
gptkbp:introducedIn 1982
gptkbp:NP-complete true
gptkbp:prohibits variable-clause incidence graph is planar
gptkbp:relatedTo gptkb:planar_graph
gptkb:3-SAT
gptkbp:restrictionOf gptkb:3-SAT
gptkbp:usedIn theoretical computer science
graph theory
algorithmic reductions
proofs of NP-completeness
gptkbp:bfsParent gptkb:Planar_SAT
gptkbp:bfsLayer 7