演算法›Ch5 NP Complete Problems
第 22 題/共 30 題
◀ AL 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 LL in polynomial time, then LL is NP-complete.

(2) (3%) If a problem AA can be reduced to a problem BB and A∈PA \in P, then B∈PB \in P.

(3) (3%) If a problem A∈PA \in P, then A∈NPA \in NP.

📄 成大110
跳轉到第題
▤完整推導請見《WH 資工筆記 · 演算法》Ch5 NP Complete Problems
本章題號 · 21–30 / 30