A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing


  • one year ago

SubsetGCD is described by the following: instance: A set of positive integers S and an integer k question: does there exist a subset S′ of S of size k such that GCD(S′)=GCD(S) Prove that SubsetGCD is np complete. The hint for the problem is to reduce VertexCover to SubsetGCD

  • This Question is Closed
  1. anonymous
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    I know what I'm supposed to do. Given an instance of VertexCover convert it into the form of SubsetGCD such that there exists a vertex cover of size k if and only if there exists a subset S′ of size k such that GCD(S′)=GCD(S)

  2. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...


  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.