If I can assume that it is NP-complete to determine whether a set of objects can be packed into 2 bins, how can I prove that it is NP-complete to determine whether a set of objects can be packed into 3 bins?
I understand that this is like the Knapsack problem, but I am having trouble going backwards essentially, since 2 bins is the reduced version of 3 bins.
