Relation between the hardness of a problem and the number of its solutions (Q540772)
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: Relation between the hardness of a problem and the number of its solutions |
scientific article; zbMATH DE number 5903970
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Relation between the hardness of a problem and the number of its solutions |
scientific article; zbMATH DE number 5903970 |
Statements
Relation between the hardness of a problem and the number of its solutions (English)
0 references
3 June 2011
0 references
hardness of a problem
0 references
number of solutions
0 references
subset sum problem
0 references
knapsack problem
0 references
bounded integer programming problem
0 references
knapsack optimization problem
0 references
NP-hard
0 references
0.8500291
0 references
0.8433221
0 references
0.83525854
0 references
0.83525854
0 references
0.83298576
0 references
0.8309064
0 references
