ProGrads 卷別
資料結構及演算法
選擇國立政治大學 2025 · 考試 · 第 13 題
考科演算法
(4%) Which of the following statements concerning reduction is false?
- (A)The bipartite graph matching problem can be reduced to the network flow problem.
- (B)If a problem X is polynomial reducible to a problem Y, then the lower bound of X can be applied to Y.
- (C)A problem X is NP-Complete if X is polynomial reducible to some NP-Complete problem Y.
- (D)A problem X is an NP-hard problem if every problem in NP is polynomial reducible to X.