From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701)
From MaRDI portal
scientific article; zbMATH DE number 7236283
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More |
scientific article; zbMATH DE number 7236283 |
Statements
From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (English)
0 references
18 August 2020
0 references
hardness of approximation
0 references
parameterized complexity
0 references
subexponential-time algorithms
0 references
fine-grained complexity
0 references
clique
0 references
dominating set
0 references
