ProGrads 卷別
資料結構及演算法
選擇國立政治大學 2025 · 考試 · 第 14 題
考科演算法
(4%) Which of the following statements is false?
- (A)Every problem which can be solved in polynomial time by deterministic algorithms must be a NP problem.
- (B)A problem is NP-hard if it is as least as hard as all NP problems.
- (C)If any NP-Complete problem can be solved in polynomial time, then all NP-hard problems can be solved in polynomial time.
- (D)Every NP-Complete problem must be NP.