New answers tagged

1 vote

Showing that a modification of an NP-Complete problem is also NP-Complete

tl;dr: Showing that the Extended Knapsack problem is NP-Complete is easy through the original Knapsack, but you have to define the two problems correctly. For a problem to be NP-Complete, it has to be ...
user avatar

Top 50 recent answers are included