|
Related articles:
NP-complete
NP (complexity)
Computational complexity theory
Key terms: np h problem if any hard does call class complexity reduction hence polynomial time example stands oracle algorithm decision problem machine definition question halting problem hard as np least as hard turing reduction necessarily in np all problems in np optimization problem solved in polynomial time Search external links cited by footnotes on Wikipedia page NP-hard: |
|