A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem.

Martin E. Dyer Alan M. Frieze Ravi Kannan Ajai Kapoor Ljubomir Perkovic Umesh V. Vazirani A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem. 271-284 1993 2 Combinatorics, Probability & Computing db/journals/cpc/cpc2.html#DyerFKKPV93 http://dx.doi.org/10.1017/S0963548300000675