Purchase Solution

proving a problem is NP

Not what you're looking for?

Ask Custom Question

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 ]

Attachments
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.

View More Free Quizzes
Related BrainMass Solutions

  • Automata and Computability .

    This is trivial since NP is a subset of PSPACE, and therefore, anything outside of PSPACE is also outside of NP. Then we must show that any problem in NP can be reduced to any PSPACE-hard language.

  • Proof by contradiction

    But, by the time hierarchy theorem, TIME(nk+1) contains a language which isn't in TIME(nk), which contradicts P  TIME(nk). Therefore P  NP. See attached file for full problem description.

  • NP-Harp

    In this problem you are to prove a different property of D, namely, that D is NP-hard. A problem is NP-hard if all problems in NP are polynomial time reducible to it, even though it may not be in NP itself.

  • Automata and Computability

    Therefore SAT is not in P. Because SAT is in NP, it must be true that P is not equal to NP. Please see the attached file. Problem 34 Problem: Describe the error in the following fallacious "proof" that P  NP.

  • Statistics Problem: Young Adult Drug Use

    This is a binomial probability. since np=500*3.8%=19>5, n*(1-p)=500*(1-3.8%)=481>5, we could use normal distribution to approximate the probability. mean=np=500*3.8%=19.

  • Moving a Sliding Dresser

    Note that this problem is two-dimensional. A. If the dresser is sliding with constant velocity, find F, the magnitude of the force that Sam applies. B. Find the magnitude of the normal force. C. Find the magnitude of the normal force. D.

  • Functions and infinity

    From the previous problem , we can see that we can model these functions as a ratio of 2 polynomials p(x)/q(x) such that the order of q(x) is greater than the order of p(x).

  • Probabilities for Loan Authorization

    Then (1) The probability of success is p=7%=0.07 (2) X follows a binomial distribution with parameters n=35 and p=0.07 (3) Using the fact that when X follows a binomial distribution with parameters n and p, E(X)=np and Var(X)=np(1

  • Mean and variance

    If 25% of the children in the school are first graders, and the children are selected at random, what is the mean and variance of the number of first graders chosen? This is a binomial problem.

View More Related Solutions