The 3-SAT problem is reduced to Sum of Subsets problem in poly-time. The solution(obtained by non-deterministic way) is verified with the Sum of Subsets problem. The equivalent solution is used to verify the 3-SAT problem and found that they are identical. Hence we can declare that Sum of Subsets is NP-Complete.
Негізгі бет Sum of Subsets is NP-Complete
Пікірлер