Sure, no disagreement here

Sure, no disagreement here

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

送交者: 自如于 2010-03-29, 20:27:24:

回答: generally when we say NP, means problems can be solved 由 steven 于 2010-03-29, 19:51:09:

We (or perhaps just some of us, me included) use NP-hard to refer carelessly to the union of all horrible complexity classes beyond the lovely P :)

Is there a common (more correct) term for such thing you are aware of?

Yes, that has to do with polynomial time turing reduction. - steven (585 bytes) 2010-03-29, 20:54:00 (427135)
- I actually asked about a different thing, but it doesn't matter :) - 自如 (126 bytes) 2010-03-29, 23:07:55 (427193)
  - you meant the name NP-Hard? It is the official name. (无内容) - steven (0 bytes) 2010-03-30, 00:22:13 (427199)