A generic approach to proving NP-hardness of partition type problems (Q608273)
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: A generic approach to proving NP-hardness of partition type problems |
scientific article; zbMATH DE number 5819504
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A generic approach to proving NP-hardness of partition type problems |
scientific article; zbMATH DE number 5819504 |
Statements
A generic approach to proving NP-hardness of partition type problems (English)
0 references
25 November 2010
0 references
computational complexity
0 references
discrete optimization
0 references
scheduling
0 references
0 references
0 references
0.7683025002479553
0 references
0.752243161201477
0 references
