演算法›Ch5 NP Complete Problems第 22 題/共 30 題
22. NP-Complete、P 與 NP
#AL-05-022中NP-CompleteP 與 NP
(15%) Answer True or False for the following statements and also justify your reasons.
(1) (3%) If an NP-complete problem can be reduced to a problem in polynomial time, then is NP-complete.
(2) (3%) If a problem can be reduced to a problem and , then .
(3) (3%) If a problem , then .
📄 成大110
▤完整推導請見《WH 資工筆記 · 演算法》Ch5 NP Complete Problems