# Wikipedia Authors - NP-completeness (Highlights) ![rw-book-cover|256](https://readwise-assets.s3.amazonaws.com/static/images/article4.6bc1851654a0.png) ## Metadata **Cover**:: <https://readwise-assets.s3.amazonaws.com/static/images/article4.6bc1851654a0.png> **Source**:: #from/readwise **Zettel**:: #zettel/fleeting **Status**:: #x **Authors**:: [[Wikipedia Authors]] **Full Title**:: NP-completeness **Category**:: #articles #readwise/articles **Category Icon**:: 📰 **Document Tags**:: #computer-science **URL**:: [en.wikipedia.org](https://en.wikipedia.org/wiki/NP-completeness?oldformat=true) **Host**:: [[en.wikipedia.org]] **Highlighted**:: [[2020-02-06]] **Created**:: [[2022-09-26]] ## 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