Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
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
|
| https://www.w3.org/2000/01/rdf-schema#label |
Planar SAT
|
| gptkbp:referencedIn |
gptkb:Lichtenstein,_D._(1982)._Planar_formulae_and_their_uses._SIAM_J._Comput.
|
| gptkbp:relatedTo |
gptkb:SAT
Boolean satisfiability problem |
| gptkbp:restrictionOf |
gptkb:SAT
|
| gptkbp:studiedIn |
theoretical computer science
|
| gptkbp:usedIn |
gptkb:complexity_theory
graph theory |
| gptkbp:bfsParent |
gptkb:Boolean_satisfiability_problem
|
| gptkbp:bfsLayer |
6
|