'''Originally Posted By: xbaonguyenx''' Prove that the Knapsack problem discussed in class is in NP. Anyone know the lecture slide for this question? Any hint?<br>Thanks

-- Home work #5 Writing Part Question 4

'''Originally Posted By: kohdmonkey''' There are no information about this on the lecture slides. <br>The problem is pretty popular though, here is the wiki link for it http://en.wikipedia.org/wiki/Knapsack_problem

-- Home work #5 Writing Part Question 4

'''Originally Posted By: dburke''' hint: prove it can be done in polynomial time