An alternative approach for proving the NP-hardness of optimization problems (Q320621)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An alternative approach for proving the NP-hardness of optimization problems |
scientific article; zbMATH DE number 6635655
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An alternative approach for proving the NP-hardness of optimization problems |
scientific article; zbMATH DE number 6635655 |
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
0 references
0 references
0 references
0 references
