A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy (Q306252)
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 fully polynomial time approximation scheme for counting integer knapsack solutions made easy |
scientific article; zbMATH DE number 6620938
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy |
scientific article; zbMATH DE number 6620938 |
Statements
A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy (English)
0 references
31 August 2016
0 references
approximate counting
0 references
integer knapsack
0 references
dynamic programming
0 references
binding constraints
0 references
\(K\)-approximating sets and functions
0 references
0 references
0.9406588673591614
0 references
0.8641285300254822
0 references
0.8378538489341736
0 references
0.8274531960487366
0 references
