On the efficiency of polynomial time approximation schemes (Q290268)
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: On the efficiency of polynomial time approximation schemes |
scientific article; zbMATH DE number 6588316
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the efficiency of polynomial time approximation schemes |
scientific article; zbMATH DE number 6588316 |
Statements
On the efficiency of polynomial time approximation schemes (English)
0 references
1 June 2016
0 references
computational complexity
0 references
approximation algorithms
0 references
parameterized complexity
0 references
0 references
0.8584015965461731
0 references
0.8564726114273071
0 references
0.8517671823501587
0 references
0.8467472791671753
0 references
