演算法›Ch5 NP Complete Problems
第 4 題/共 30 題
◀ AL 4/30
4. NP-Complete、多項式歸約
#AL-05-004中NP-Complete多項式歸約

Let A,B,C,D,EA,B,C,D,E be decision problems. We denote a polynomial time reduction with the symbol "≤p\le_p". Suppose that A≤pBA \le_p B, B≤pCB \le_p C, C≤pDC \le_p D, and C≤pEC \le_p E. We also assume A∈PA \in P and B∈NPB \in NP. Select all correct statements below.

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