A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions (Q2903521)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions |
scientific article |
Statements
A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions (English)
0 references
10 August 2012
0 references
counting knapsack
0 references
fully polynomial approximation scheme
0 references
dynamic programming
0 references
