GRE Computer Science Question 11
11. Suppose problem A is NP-complete and problem B is in NP but is not necessarily NP-complete. Which of
the following statements is (are) necessarily true?
I. A polynomial-time algorithm for A implies P NP.
II. A polynomial-time algorithm for B implies P NP.
III. A polynomial-time algorithm for A implies a polynomial-time algorithm for B.
(A) I only (B) II only (C) I and II only (D) I and III only (E) I, II, and III
