看板 Grad-ProbAsk 關於我們 聯絡資訊
Read the following sentences and answer the questions. NOTE that explanation is necessary (a) It takes exponential number of steps to slove any NP-complete problem in worst case (b) The time complexity of any algorithm that solves a problem is an upper bound on the time complexity of this problem 請問一下這兩小題答案是什麼呢? (a)是 polynomial number? -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 61.62.73.138
soldier723:指數吧 03/01 17:06
FRAXIS:(a)只有在P!=NP的情況下才有可能成立 03/01 17:27
FRAXIS:(b)是對的 因為可以知道只要花多少時間就可以解決這問題 03/01 17:28
sa074463:恩謝謝你 03/01 23:09