☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
演算法
›
Ch5 NP Complete Problems
第 23 題／共 30 題
◀
AL 23/30
錯題回報
00:00
23. NP-Complete
#AL-05-023
易
NP-Complete
📝
☆
Choose necessary step(s) to prove that a decision problem
D
D
D
is NP-complete:
A
Show that the problem
D
D
D
can polynomially reduce to an NP-complete problem.
B
Design a non-deterministic algorithm to solve the problem
D
D
D
in exponential time complexity.
C
Design a non-deterministic algorithm to solve the problem
D
D
D
in polynomial time complexity.
D
Design a deterministic algorithm to solve the problem
D
D
D
in polynomial time complexity.
E
Show that an NP-hard problem can polynomially reduce to the problem
D
D
D
.
📝 寫筆記
📄 中央114
重做
跳轉到第
題
← 上一題
下一題 →
答案／解析
▤
完整推導請見《WH 資工筆記 · 演算法》Ch5 NP Complete Problems
‹
本章題號 · 21–30 / 30
›
全部 30
易 13
中 17
難 0
21
22
23
24
25
26
27
28
29
30
