arXiv · cond-mat/0106125
Statistical Mechanics of an NP-complete Problem: Subset Sum
Abstract
We study statistical properties of an NP-complete problem, the subset sum, using the methods and concepts of statistical mechanics. The problem is a generalization of the number partitioning problem, which is also an NP-complete problem and has been studied in the physics literature. The asymptotic expressions for the number of solutions are obtained. These results applied to the number partitioning problem as a special case are compared with those which were previously obtained by a different method. We discuss the limit of applicability of the techniques of statistical mechanics to the present problem.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
T. Sasamoto, T. Toyoizumi, H. Nishimori. 2001-06-18. Statistical Mechanics of an NP-complete Problem: Subset Sum. https://doi.org/10.1088/0305-4470%2F34%2F44%2F314
Cite the original work for its findings. Save a collection to share your selection of sources.