Solved

Let S Be an NP-Complete Problem, Q and R Be

Question 3

Multiple Choice

Let S be an NP-complete problem, Q and R be two other problems not known to be in NP. Q is polynomial-time reducible to S and S is polynomial-time reducible to R. Which one of the following statements is true?


A) R is NP-complete
B) R is NP-hard
C) Q is NP-complete
D) Q is NP-hard

Correct Answer:

verifed

Verified

Related Questions

Q1: Recursively enumerable languages are not closed under:<br>A)Union<br>B)Intersection<br>C)Complementation<br>D)Concatenation

Q2: Consider the following statements about the context

Q4: Give a production grammar for the language

Q5: A PC not connected to a network

Q6: A FSM can be considered, having finite

Q7: The following CFG is in<br>S ? Abb<br>B

Q8: The part of an FA, where the

Q9: The production Grammar is {S->aSbb,S->abb} is<br>A)type-3 grammar<br>B)type-2

Q10: Regular expression (x/y)(x/y) denotes the set<br>A){xy,xy}<br>B){xx,xy,yx,yy}<br>C){x,y}<br>D){x,y,xy}

Q11: Let SHAM3 be the problem of finding