1. Lecture Notes in Computer Science;C. Bazgan,1998
2. Borgs, C., Chayes, J.T., Pittel, B.: Sharp Threshold and Scaling Window for the Integer Partitioning Problem. In: Proc. STOC 2001, pp. 330–336 (2001)
3. Cieliebak, M., Eidenbenz, S., Pagourtzis, A., Schlude, K.: Equal Sum Subsets: Complexity of Variations; Technical Report 370, ETH Zürich, Department of Computer Science (2003)
4. Cieliebak, M., Eidenbenz, S., Penna, P.: Noisy Data Make the Partial Digest Problem NP-hard; Technical Report 381, ETH Zürich, Department of Computer Science (2002)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. San Francisco, Freeman (1979)