討論串[理工] 演算法
共 11 篇文章
內容預覽:
各位大大好,第一次來這邊問問題,以後請多指教:>. Suppose that we are given a sequence of n unsorted values, say x1,x2,...,. xn, and at the same time, we are asked to qucikly
(還有291個字)
內容預覽:
名校上的一題. If an NP-complete problem X is polynomial reducible. to a problem Y ,the Y is an NP-complete problem.. 洪捷的答案是寫FALSE. 想請問原因 是因為Y至少要比X難. 所以 Y 應該
(還有40個字)