ProGrads 卷別
資料結構與演算法
選擇國立臺灣大學 2026 · 考試 · 第 5 題
考科演算法
(4 points) Which of the following statements is known to be true?
- (A)Every NP-hard problem is polynomial-time reducible to every problem in NP.
- (B)Every NP-complete problem is polynomial-time reducible to every problem in NP.
- (C)Every problem solvable in polynomial time is polynomial-time reducible to every problem in NP.
- (D)Every problem solvable in exponential time is polynomial-time reducible to every problem in NP.
- (E)None of the other choices.