i've seen problems which are stated under NP-comleteness like "Subset Sum Problem". But there is a O(sum*n) solution to this problem using Dynamic Programming paradigm. Then why do we categorize the problem under NP-Complete ? , Am I misunderstanding something... ? Thanks in advance.. A link to any tutorial in which exhaustive analysis of NP-P concept is done, would be really helpful, Thanks in Advance..
↧