On Syntactic versus Computational Views of Approximability (Q4210142)
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 Syntactic versus Computational Views of Approximability |
scientific article; zbMATH DE number 1200782
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Syntactic versus Computational Views of Approximability |
scientific article; zbMATH DE number 1200782 |
Statements
On Syntactic versus Computational Views of Approximability (English)
0 references
21 September 1998
0 references
approximation algorithms
0 references
complete problems
0 references
computational complexity
0 references
computational classes
0 references
polynomial reductions
0 references
local search
0 references
0.89937204
0 references
0.86057436
0 references
0.8565075
0 references
0.8557049
0 references
0.85542184
0 references
0.85514736
0 references
