NP problem is practically everywhere, I was trying to point out that
所有跟贴·加跟贴·新语丝读书论坛
送交者: steven 于 2010-03-30, 01:20:16:
回答: Agree with the first sentence, but not the second one :) 由 自如 于 2010-03-30, 01:00:24:
AI and ML research does not focus on NP. NP is intractable only if P != NP, which is most likely the case. Btw, many time people attacks problem in non-deterministic way, that is why it is more efficient. Of course, non-determinstic method doesn't always give the answer.
所有跟贴:
加跟贴