Time-approximation trade-offs for inapproximable problems (Q4601874)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6829363
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Time-approximation trade-offs for inapproximable problems |
scientific article; zbMATH DE number 6829363 |
Statements
24 January 2018
0 references
approximation algorithm
0 references
complexity
0 references
polynomial approximation
0 references
subexponential approximation
0 references
reduction
0 references
inapproximability
0 references
0.9739397764205932
0 references
0.802206814289093
0 references
0.7809112668037415
0 references
0.7765246629714966
0 references
