Impagliazzo and Paturi, 2001, Journal of Computer and System Sciences
GPTKB entity
Statements (12)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:academic_journal
|
| gptkbp:author |
gptkb:Ramamohan_Paturi
gptkb:Russell_Impagliazzo |
| https://www.w3.org/2000/01/rdf-schema#label |
Impagliazzo and Paturi, 2001, Journal of Computer and System Sciences
|
| gptkbp:publicationYear |
2001
|
| gptkbp:publishedIn |
gptkb:Journal_of_Computer_and_System_Sciences
|
| gptkbp:title |
On the Complexity of k-SAT
|
| gptkbp:topic |
gptkb:Exponential_Time_Hypothesis
computational complexity Boolean satisfiability problem |
| gptkbp:bfsParent |
gptkb:Exponential_Time_Hypothesis
|
| gptkbp:bfsLayer |
7
|