Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:alsoKnownAs |
TAUT problem
|
| gptkbp:complement |
Boolean satisfiability problem
|
| gptkbp:complexity |
gptkb:co-NP-complete
|
| gptkbp:domain |
gptkb:logic
theoretical computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
TAUTOLOGY problem
|
| gptkbp:importantFor |
central in complexity theory
|
| gptkbp:input |
Boolean formula
|
| gptkbp:relatedTo |
gptkb:logic
gptkb:SAT_problem |
| gptkbp:solvedBy |
truth table method
|
| gptkbp:studiedBy |
1970s
|
| gptkbp:type |
Is the given Boolean formula a tautology?
|
| gptkbp:unsolvedQuestion |
Is TAUTOLOGY in P?
|
| gptkbp:bfsParent |
gptkb:co-NP-complete
|
| gptkbp:bfsLayer |
6
|