# proving a problem is NP

Not what you're looking for?

Please see the attachment below for the complete question.

We need to prove that the problem is NP -complete by reduction from Vertex-cover.

Problem :- Given a collection of sets { S1, S2 ,..., Sn} and a positive integer K. Does there exist a set T with at most K elements such that T disjoint Si not-equalto empty , 1<=i<=n ?

[we can use the edges in graph to create the sets in the collection ]

##### Purchase this Solution

##### Solution Summary

Proving a problem is NP is achieved.

##### Purchase this Solution

##### Free BrainMass Quizzes

##### Probability Quiz

Some questions on probability

##### Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

##### Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

##### Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

##### Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.