A deterministic polynomial-time approximation scheme for counting knapsack solutions (Q2903521)
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 deterministic polynomial-time approximation scheme for counting knapsack solutions |
scientific article; zbMATH DE number 6064774
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A deterministic polynomial-time approximation scheme for counting knapsack solutions |
scientific article; zbMATH DE number 6064774 |
Statements
10 August 2012
0 references
counting knapsack
0 references
fully polynomial approximation scheme
0 references
dynamic programming
0 references
0.9721638
0 references
0.9281723
0 references
0.9218229
0 references
0.9195834
0 references
0.90968615
0 references
0.9089805
0 references
A deterministic polynomial-time approximation scheme for counting knapsack solutions (English)
0 references
