Dynamic Programming 3

65The subset-sum problem is defined as follows: Given a set S of n positive integers and a positive integer W; determine whether there is a subset of S whose elements sum to W. An algorithm Q solves this problem in O(nW) time. Which of the following statements is false?

Option : B
Explanation :
We can’t solve in polynomial time if input is encoded in binary.

Forgot your password?

I agree with the Terms.