Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems (Q915446)
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 4151818
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems |
scientific article; zbMATH DE number 4151818 |
Statements
Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems (English)
0 references
1990
0 references
optimization problem
0 references
many-one reducibility
0 references
NP-complete problem
0 references
Turing reducibility
0 references
0 references
0.7954513430595398
0 references
0.792924702167511
0 references
0.7503839135169983
0 references
