Time-approximation trade-offs for inapproximable problems (Q1678175)
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: Time-approximation trade-offs for inapproximable problems |
scientific article; zbMATH DE number 6806910
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Time-approximation trade-offs for inapproximable problems |
scientific article; zbMATH DE number 6806910 |
Statements
Time-approximation trade-offs for inapproximable problems (English)
0 references
14 November 2017
0 references
approximation algorithms
0 references
exponential algorithms
0 references
sub-exponential algorithms
0 references
hardness of approximation
0 references
0 references
0 references
0 references
