Search in: Word
Vietnamese keyboard: Off
Virtual keyboard: Show
Computing (FOLDOC) dictionary
NP-hard
Jump to user comments
complexity A set or property of computational searchproblems. A problem is NP-hard if solving it in polynomialtime would make it possible to solve all problems in class
NP in polynomial time.