Well-solvable instances for the partition problem
暂无分享,去创建一个
We characterize all numbers n and S with the following property: Every instance of the partition problem that consists of n positive integers with sum S possesses a solution, that is, a partition into two subsets with equal sum.
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] David S. Johnson,et al. Computers and Inrracrobiliry: A Guide ro the Theory of NP-Completeness , 1979 .