An alternative approach for proving the NP-hardness of optimization problems (Q320621)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An alternative approach for proving the NP-hardness of optimization problems |
scientific article |
Statements
An alternative approach for proving the NP-hardness of optimization problems (English)
0 references
7 October 2016
0 references
combinatorial optimization
0 references
computational complexity
0 references
scheduling
0 references
