作者aether982 (阿青是我是阿青)
看板TransCSI
标题Re: [问题] NP problem& P problem?怎麽区分?
时间Tue Jun 14 00:27:15 2005
※ 引述《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