The following pages link to (Q4636439):
Displaying 4 items.
- A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy (Q306252) (← links)
- Approximate \#knapsack computations to count semi-fair allocations (Q2110714) (← links)
- A deterministic polynomial-time approximation scheme for counting knapsack solutions (Q2903521) (← links)
- (Q3380215) (← links)