One form of the knapsack problem is as follows: We are given a set of integersA = a1
Chapter 10, Problem 10.57(choose chapter or problem)
One form of the knapsack problem is as follows: We are given a set of integersA = a1, a2, ... , aN and an integer K. Is there a subset of A whose sum is exactly K?a. Give an algorithm that solves the knapsack problem in O(NK) time.b. Why does this not show that P = NP?
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer