Yet, it cannot be expected that an algorithm can find, in polynomial time, a solution to an arbitrary GCP instance, because the GCP is NP-hard.
英
美
-
由于對于任意一個(gè)圖著(zhù)色例子而言,沒(méi)有一種算法可以在多項式的時(shí)間內找到它的解,因此圖的著(zhù)色問(wèn)題是一個(gè)NP難的問(wèn)題。
-
国内精品美女A∨在线播放xuan