Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk) (Q5363756)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk) |
scientific article; zbMATH DE number 6784955
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8309318
0 references
0.8306094
0 references
0.8305328
0 references
0.82322866
0 references
0.82319164
0 references
