問題詳情

81. Which of the following is not an NP-complete problem?
(A) Traveling salesman problem
(B) Dominating set problem
(C) Subgraph isomorphism problem
(D) Discrete logarithm problem

參考答案

無參考答案

內容推薦

內容推薦