Polynomially bounded minimization problems which are hard to approximate (Q4630248): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/3-540-56939-1_61 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1557755441 / rank | |||
Normal rank | |||
Revision as of 20:16, 19 March 2024
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
