What did I say that is not true? Note that I said NP-hard, not NP.


所有跟贴·加跟贴·新语丝读书论坛

送交者: 自如 于 2010-03-29, 19:10:05:

回答: No that is not true, EXPTIME is bigger, 由 steven 于 2010-03-29, 18:52:42:

引用:
NP-hard (non-deterministic polynomial-time hard), in computational complexity theory, is a class of problems that are, informally, "at least as hard as the hardest problems in NP".

Note *at least*.

In any case, this does not affect main points in our earlier discussion.




所有跟贴:


加跟贴

笔名: 密码: 注册笔名请按这里

标题:

内容: (BBCode使用说明