Planar SAT

URI: https://gptkb.org/entity/Planar_SAT

GPTKB entity

Predicate	Object
gptkbp:instanceOf	gptkb:theoretical_computer_science gptkb:computational_complexity_problem
gptkbp:complexity	NP-complete
gptkbp:definedIn	Boolean formula whose incidence graph is planar
gptkbp:firstProvedNPCompleteBy	gptkb:Michael_Sipser gptkb:David_Lichtenstein
gptkbp:firstProvedNPCompleteIn	1982
gptkbp:generalizes	gptkb:planar_3-SAT
gptkbp:hasIncidenceGraph	gptkb:planar_graph
gptkbp:referencedIn	gptkb:Lichtenstein,_D._(1982)._Planar_formulae_and_their_uses._SIAM_J._Comput.
gptkbp:relatedTo	gptkb:Boolean_satisfiability_problem gptkb:SAT
gptkbp:restrictionOf	gptkb:SAT
gptkbp:studiedIn	gptkb:theoretical_computer_science
gptkbp:usedIn	gptkb:complexity_theory graph theory
https://www.w3.org/2000/01/rdf-schema#label	Planar SAT