Beier, Rene Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Vöcking, Berthold Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Beier, R., & Vöcking, B. (2003). Random Knapsack in Expected Polynomial Time. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC-03) (pp. 232-241). New York, USA: ACM.