# Wikipedia Authors - NP-completeness (Highlights) ![rw-book-cover|256](https://readwise-assets.s3.amazonaws.com/static/images/article4.6bc1851654a0.png) ## Highlights - A problem is said to be [NP-hard](https://en.wikipedia.org/wiki/NP-hard "NP-hard") if everything in NP can be transformed in polynomial time into it, and a problem is NP-complete if it is both in NP and NP-hard