Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I'm reading up about the Knapsack problem on Wiki and it's associated problem, the subset sum problem. However, the language is a little vague, so I'd like to clarify about what exactly is going on here.

If I define my problem to be a set of positive integers only, to target a positive integer, is that still an NP-complete problem of the subset-sum/knapsack variant?

share|cite|improve this question
up vote 1 down vote accepted

In Sipser's book he gives a nice reduction from 3SAT to Subset Sum which uses only positive numbers, so the problem is still NP-complete.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.