Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk) (Q5363756)
From MaRDI portal
scientific article; zbMATH DE number 6784955
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk) |
scientific article; zbMATH DE number 6784955 |
Statements
29 September 2017
0 references
reductions
0 references
satisfiability
0 references
strong exponential time hypothesis
0 references
shortest paths
0 references
3SUM
0 references
equivalences
0 references
fine-grained complexity
0 references
Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk) (English)
0 references
