Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
Boolean satisfiability problem |
| gptkbp:complexity |
P
|
| gptkbp:hasPolynomialTimeAlgorithm |
true
|
| https://www.w3.org/2000/01/rdf-schema#label |
2SAT
|
| gptkbp:input |
gptkb:conjunctive_normal_form
|
| gptkbp:isA |
special case of SAT
|
| gptkbp:isSolvable |
polynomial time
|
| gptkbp:numberOfLiteralsPerClause |
2
|
| gptkbp:output |
satisfiable or unsatisfiable
|
| gptkbp:reduces |
strongly connected components
|
| gptkbp:relatedTo |
gptkb:3SAT
gptkb:Horn-SAT |
| gptkbp:solvedBy |
gptkb:Kosaraju's_algorithm
gptkb:Tarjan's_algorithm implication graph |
| gptkbp:studiedBy |
1970s
|
| gptkbp:usedIn |
gptkb:artificial_intelligence
theoretical computer science circuit design |
| gptkbp:bfsParent |
gptkb:3SAT
|
| gptkbp:bfsLayer |
7
|