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?
Is the 0-1 Knapsack problem where value equals weight NP-complete?
complexity theory;np complete;decision problem;packing
Yes, this is called the subset-sum problem and is NP-Hard.