Re: [問題] NP problem& P problem?怎麼區分?
※ 引述《dynamicy (小人物)》之銘言：
: 不是很懂這個怎麼區分?...
: 可以麻煩那位解說一下,感謝!
P denotes the class of all problems that can be
solved by deterministic algorithms in polynomial
time.
NP denotes the class of all problems that can be
solved by nondeterministic algorithms in polynomial
time.
A nondeterministic algorithm, when faced with a
choice of several options, has the power to guess
the right one (if there is any).
We will focus on decision problems, whose answer
is either yes or no.
演算法上課的講義
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 61.228.85.140
討論串 (同標題文章)