Studying the complexity of global verification for NP-hard discrete optimization problems (Q1402543)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Studying the complexity of global verification for NP-hard discrete optimization problems |
scientific article |
Statements
Studying the complexity of global verification for NP-hard discrete optimization problems (English)
0 references
28 August 2003
0 references
computational complexity
0 references
discrete optimization problems
0 references
local search algorithms
0 references
NP-hard
0 references
