generally when we say NP, means problems can be solved
所有跟贴·加跟贴·新语丝读书论坛
送交者: steven 于 2010-03-29, 19:51:09:
回答: What did I say that is not true? Note that I said NP-hard, not NP. 由 自如 于 2010-03-29, 19:10:05:
in non-deterministic polynomial time algorithm, regardless it is NP-Complete or NP-Hard. EXPTIME means problem can be solve in $2^{p(n)}$ where p is a polynomial of n. You see there is no registration that the problem can be solve with any algorithm in polynomial time at all.
所有跟贴:
加跟贴