A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy

Nir Halman. A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy. Theoretical Computer Science, 645:41-47, 2016. [doi]

Abstract

Abstract is missing.