Polynomially bounded minimization problems which are hard to approximate (Q4630248)
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: Polynomially bounded minimization problems which are hard to approximate |
scientific article; zbMATH DE number 7045102
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomially bounded minimization problems which are hard to approximate |
scientific article; zbMATH DE number 7045102 |
Statements
Polynomially bounded minimization problems which are hard to approximate (English)
0 references
29 March 2019
0 references
Turing machine
0 references
short computation
0 references
input instance
0 references
3CNF formula
0 references
linear reduction
0 references
