Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:theoretical_computer_science
gptkb: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
|
| 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 |
gptkb:theoretical_computer_science
graph theory algorithmic reductions proofs of NP-completeness |
| https://www.w3.org/2000/01/rdf-schema#label |
planar 3-SAT
|