To prove P != NP, we will learn many important properties
所有跟贴·加跟贴·新语丝读书论坛
送交者: steven 于 2011-02-20, 22:20:41:
回答: thanks. also read your other response. 由 短江学者 于 2011-02-20, 18:32:58:
of infinite set. Since currently, beside enumeration and diagonal argument, we don't have much tools to deal with general infinite set. That is the reason why P != NP is so hard. On the other hand, QC is known to be able to significantly speed up certain algorithms. This is promising.
所有跟贴:
加跟贴