Karp's 21 NP-complete problems
Karp's 21 NP-complete problems
Common
Rarity: Common
The most frequent rarity: most Wikipedia articles become Commons.
Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.
At a glance
- Class
- Notion
- Domain
- Science and technology
- In collections
- Nobody has pulled it yet.
What Wikipedia says
In computational complexity theory, Karp's 21 NP-complete problems are a set of computational problems which are NP-complete.
Excerpt from the Wikipedia article “Karp's 21 NP-complete problems”, under the CC BY-SA 4.0 license. Read the article on Wikipedia
Open free boosters and add Karp's 21 NP-complete problems to your collection.
Play for free
