1 paper
Paweł Gawrychowski, Liran Markin, Oren Weimann
Given a set W={w1,…,wn} of non-negative integer weights and an integer C, the #Knapsack problem asks to count the number of distinct subsets of W whose total weig…