Statements (25)
Predicate | Object |
---|---|
gptkbp:instanceOf |
theoretical computer science
Boolean satisfiability problem |
gptkbp:canBe |
strongly connected components
implication graph linear time algorithm |
gptkbp:complexity |
P
|
gptkbp:firstDescribed |
1970s
|
gptkbp:generalizes |
gptkb:1-SAT
|
gptkbp:hasApplication |
gptkb:artificial_intelligence
circuit design constraint satisfaction |
gptkbp:hasSpecialCase |
gptkb:k-SAT
gptkb:SAT |
https://www.w3.org/2000/01/rdf-schema#label |
2-SAT
|
gptkbp:input |
gptkb:conjunctive_normal_form
|
gptkbp:inputRestriction |
each clause has at most 2 literals
|
gptkbp:isEasierThan |
gptkb:3-SAT
|
gptkbp:isNPComplete |
false
|
gptkbp:isPolynomialTimeSolvable |
true
|
gptkbp:subspecies |
Boolean satisfiability problem
|
gptkbp:usedIn |
theoretical computer science
|
gptkbp:bfsParent |
gptkb:3-SAT
gptkb:Boolean_satisfiability_problem gptkb:SAT_problem |
gptkbp:bfsLayer |
6
|