1

I am learning Computational Complexity.

Is Knapsack-optimization problem (find an arrangement to maximize the value) known to be NP-hard, while Knapsack-search problem (find an arrangement so that value >= a number) known to be NP-complete?

For the Knapsack-search problem to be NP-complete, should I have assumed that all weight, value are integer?

Thang Tran
  • 111
  • 3
  • https://cs.stackexchange.com/q/9556/755, https://en.wikipedia.org/wiki/Decision_problem – D.W. Nov 21 '21 at 01:56
  • https://cs.stackexchange.com/questions/137136/does-np-hard-problems-have-to-be-decision-problems-what-the-fact-please-cont/ – Nathaniel Nov 21 '21 at 10:22

0 Answers0