GATE 2008 CS – Question 44
Subset sum: given n positive integers S and positive W, determine whether a subset sums to W. Algorithm Q takes O(nW) time. Which is false?
Practise this question in The GATE Grind →
Show answer and explanation
Correct answer: (B) Q is polynomial when input is binary.
Explanation
We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort