Another problem due to definition :)
所有跟贴·加跟贴·新语丝读书论坛
送交者: 自如 于 2010-03-29, 19:48:16:
回答: The problem in NP-Hard has to be solvable in poly-time with an oracle machine. 由 steven 于 2010-03-29, 19:34:35:
Anyway, the important thing is that this doesn't affect the main points we discussed. Or does it?
所有跟贴:
加跟贴