Strong Exponential Time Hypothesis
GPTKB entity
Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
computational complexity hypothesis
|
| gptkbp:abbreviation |
SETH
|
| gptkbp:citation |
many complexity theory papers
|
| gptkbp:consequence |
If SETH is false, many problems in P can be solved faster than currently known.
If SETH is true, k-SAT cannot be solved in sub-exponential time for large k. |
| gptkbp:field |
theoretical computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
Strong Exponential Time Hypothesis
|
| gptkbp:implies |
gptkb:Exponential_Time_Hypothesis
|
| gptkbp:proposedBy |
gptkb:Ramamohan_Paturi
gptkb:Russell_Impagliazzo 2001 |
| gptkbp:relatedTo |
gptkb:Exponential_Time_Hypothesis
k-SAT problem |
| gptkbp:state |
For every ε > 0, there exists a k such that k-SAT cannot be solved in O(2^{(1-ε)n}) time.
|
| gptkbp:usedIn |
fine-grained complexity theory
conditional lower bounds |
| gptkbp:bfsParent |
gptkb:Exponential_Time_Hypothesis
|
| gptkbp:bfsLayer |
7
|