Problem
Given a list of n positive integers (n even), divide the list into two subsists such that the difference between the sums of the integers in the two subsists is minimized. Is this problem an NP-complete problem? Is this problem an NP-hard problem?