Re: [問題]關於Polynomial time solution~
※ 引述《librayan926 (YAN)》之銘言：
: ※ 引述《antirazin (你今天督了嗎XD)》之銘言：
: : 爬過文我還是有一些問題
: : 1.P problem 是否等於 Polynomial problem ?
: : (也就是多項式時間內能解決的問題一定是多項式問題嗎?)
: polynomial time can solve problem that is a polynmial problem
: P Problem the same polynomial problem
: : 2.處理某個問題時，
: : polynomial time solution 一定比 exponential time solution 好嗎?
: just like contest time better than polynomial time.
: the exponential time solution is better then polynomial time
: solution absolutely.
: : 3.NP問題究竟可不可以用Turing Machine解決?
: yes, turing machine is a dream machine
: offer a model to research limit of computational process
下列哪一個是正確的？
(1)A problem that has a polynomial time solution can always be solved in
a practical amount of time
(2)A polynomial is also an NP problem
(3)A non-polynomial problem is called an NP problem
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 125.228.17.211
討論串 (同標題文章)