問題詳情
21. Let S be an NP-complete problem and Q and R be two other problems not known to be in NP. Q is polynomial-timereducible to S and S is polynomial-time reducible to R. Which of the following statements is true?
(A)R is NP-complete.
(B) Ris NP-hard.
(C) Ois NP-complete.
(D) Q is NP-hard.
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增