NP -complete problem, any of a class of computational problems for which no efficient solution algorithm has been found. Many significant computer-science ...
確定! 回上一頁