Open In App

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

Subset Equality is NP Complete

Subset Equality Problem: Given a set S of non-negative integer values, the problem is to identify if there is a partition of the set S into two sets X and Y, such that, the integer sum in X is equal to the sum of integers in Y.

Explanation:
An instance of the problem is an input specified to the problem. An instance of the Subset Equality Problem is a set S. Since an NP-Complete problem is a problem which is both in NP and NP-hard, the proof for the statement that a problem is NP-Complete consists of two parts:



  1. The problem itself is in NP class.
  2. All other problems in NP class can be polynomial-time reducible to that.(B is polynomial-time reducible to C is denoted as B ≤ PC)

If the 2nd condition is only satisfied then the problem is called NP-Hard.

But it is not possible to reduce every NP problem into another NP problem to show its NP-Completeness all the time. Therefore, to show a problem is NP-Complete, then proof that the problem is in NP and any NP-Complete problem is reducible to that i.e., if B is NP-Complete and B ≤ PC then for C in NP, then C is NP-Complete. Thus, it can be concluded that the Subset Equality Problem is NP-Complete using the following two propositions:



  1. Subset equality is in NP
  2. Subset equality is NP-Hard

This two proposition can be proved as the Subset Equality Problem is a special case of the Subset Sum Problem where the sum of each partition of subset X and Y in S can be set as:

Since the subset-sum is NP-Complete, the subset equality problem also becomes NP-Complete.

Article Tags :
Analysis of Algorithms
DSA
Graph
Recommended Articles
1. Find a non empty subset in an array of N integers such that sum of elements of subset is divisible by N
2. Largest possible Subset from an Array such that no element is K times any other element in the Subset
3. Sum of maximum and minimum of Kth subset ordered by increasing subset sum
4. Split Array into K non-overlapping subset such that maximum among all subset sum is minimum
5. Maximum size of subset such that product of all subset elements is a factor of N
6. Find maximum subset sum formed by partitioning any subset of array into 2 partitions with equal sum
7. Minimum Subset sum difference problem with Subset partitioning
8. Python List Equality | Program to check if two given matrices are identical
9. XOR adjacent equality check
10. Compare Strings for equality or lexicographical order in different programming Languages
11. String Partitioning for Character Equality
12. Subset Sum is NP Complete
13. Maximum size subset with given sum
14. Largest subset with sum of every pair as prime
15. Find the size of largest subset of anagram words
16. Largest subset with M as smallest missing number
17. Largest subset with maximum difference as 1
18. Fibonacci sum of a subset with all elements <= k
19. Check if bitwise AND of any subset is power of two
20. Minimum product subset of an array
21. Maximum subset with bitwise OR equal to k
22. Find all distinct subset (or subsequence) sums of an array | Set-2
23. Check whether bitwise AND of a number with any subset of an array is zero or not
24. Subset array sum by generating all the subsets
25. Smallest Greater (than S) String of length K whose letters are subset of S