I've read that subset sum is NP-complete. What happens when I change the decision problem to look for a constant number? So the decision problem would look like this:
Input: A collection of nonnegative integers A and a nonnegative integer b,
Output: Boolean value indicating whether some subset of the collection sums to 10
Would this still be NP-complete? I don't believe you would be able to reduce every other NP-complete problem to it.