You are here: irt.org | FOLDOC | NP-hard
<complexity> A set or property of computational search problems. A problem is NP-hard if solving it in polynomial time would make it possible to solve all problems in class
NP in polynomial time.
Some NP-hard problems are also in NP (these are called
"NP-complete"), some are not. If you could reduce an NP
problem to an NP-hard problem and then solve it in polynomial
time, you could solve all NP problems.
See also computational complexity.
Nearby terms: np « NPC « NP-complete « NP-hard » NP-hilarious » NPL » NPPL
FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL
©2018 Martin Webb