Question: More formally, consider the following decision problem: given n items (say a1, . . . an), given m subsets of these items S1, S2, .
More formally, consider the following decision problem: given n items (say a1, . . . an), given m subsets of these items S1, S2, . . . , Sm, and given an integer k, does there exist a set S of at most k items such that |S Si| 1 for all i {1, . . . , m}. Prove that this problem is in NP
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
