Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems (Q915446): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:08, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems |
scientific article |
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
