Why Is Subset Sum Np Complete?

Once we have the set S, we can verify the solution by summing up the corresponding Ais and comparing this sum with T. The number of additions is at most n-1. So the addition and comparision can be done in polynomial time. Hence, SUBSET-SUM is in NP.

Is Subset Sum Problem NP-complete?

Therefore, the Subset Sum Problem is NP-Complete.

Is Subset Sum Problem is an example of NP-complete problem?

The Subset Sum Problem is a member of the NP-complete class, so no known polynomial time algorithm exists for it. Although there are polynomial time approximations and heuristics, these are not always acceptable, yet exact-solution algorithms are unfeasible for large input.