Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems (Q915446): 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.1016/0020-0190(90)90188-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2060079637 / rank | |||
Normal rank | |||
Revision as of 22:17, 19 March 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
