12

I have a problem which I suspect is NP-complete. It is easy to prove that it is NP. My current train of thought revolves around using a reduction from knapsack but it would result in instances of 0-1-Knapsack with the value of every item being equal to its weight.

Is this still NP-complete? Or am I missing something?

Raphael
  • 73,212
  • 30
  • 182
  • 400
Zeta Two
  • 255
  • 2
  • 6

1 Answers1

11

Yes, this is called the subset-sum problem and is NP-Hard.

Aryabhata
  • 6,291
  • 2
  • 36
  • 47