☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
演算法
›
Ch5 NP Complete Problems
第 29 題／共 30 題
◀
AL 29/30
錯題回報
00:00
29. NP-Complete、NP-Hard
#AL-05-029
中
NP-Complete
NP-Hard
📝
☆
Choose the correct statement(s):
A
It has been proved that there exists no deterministic algorithm that can solve any given NPC problem with a polynomial time complexity in the worst case.
B
If we can prove that the worst-case problem lower bound of an NPC problem is of a polynomial order, then we can prove that
N
P
≠
P
NP \ne P
N
P
=
P
.
C
If we can prove that an existing NP-hard problem is polynomially reducible to a problem X, then X is NP-hard.
D
If a problem is proved to be an NP-hard and NP problem, then it is an NPC problem.
E
If a problem X can be solved by a non-deterministic algorithm taking a polynomial time complexity in the worst case, then X is an NP problem.
📝 寫筆記
📄 中央111
重做
跳轉到第
題
← 上一題
下一題 →
答案／解析
▤
完整推導請見《WH 資工筆記 · 演算法》Ch5 NP Complete Problems
‹
本章題號 · 21–30 / 30
›
全部 30
易 13
中 17
難 0
21
22
23
24
25
26
27
28
29
30
