Home › Entities › set › Karp's 21 NP-complete problems

Karp's 21 NP-complete problems

set of computational problems
Thing set Q1734364
Press Enter · cited answer in seconds

Karp's 21 NP-complete problems

Summary

Karp's 21 NP-complete problems is a set[1]. It draws 150 Wikipedia views per month (set category, ranking #7 of 16).[2]

Key Facts

  • Karp's 21 NP-complete problems is the creator of Richard M. Karp[3].
  • Karp's 21 NP-complete problems's instance of is recorded as set[4].
  • Richard M. Karp is named after Karp's 21 NP-complete problems[5].
  • NP-complete is named after Karp's 21 NP-complete problems[6].
  • Karp's 21 NP-complete problems's has part is recorded as boolean satisfiability problem[7].
  • Karp's 21 NP-complete problems's has part is recorded as vertex cover problem[8].
  • Karp's 21 NP-complete problems's has part is recorded as 3-satisfiability problem[9].
  • Karp's 21 NP-complete problems's has part is recorded as exact cover[10].
  • Karp's 21 NP-complete problems's has part is recorded as set packing[11].
  • Karp's 21 NP-complete problems's has part is recorded as knapsack problem[12].
  • Karp's 21 NP-complete problems's has part is recorded as maximum cut[13].
  • Karp's 21 NP-complete problems's has part is recorded as Hamiltonian path problem[14].
  • Karp's 21 NP-complete problems's has part is recorded as partition problem[15].
  • Karp's 21 NP-complete problems's has part is recorded as clique cover problem[16].
  • Karp's 21 NP-complete problems's has part is recorded as set cover problem[17].
  • Karp's 21 NP-complete problems's has part is recorded as clique problem[18].
  • Karp's 21 NP-complete problems's has part is recorded as Feedback arc set[19].
  • Karp's 21 NP-complete problems's has part is recorded as feedback vertex set[20].
  • Karp's 21 NP-complete problems's has part is recorded as Steiner tree problem[21].
  • Karp's 21 NP-complete problems's has part is recorded as job-shop scheduling[22].
  • Karp's 21 NP-complete problems's has part is recorded as 3-dimensional matching[23].
  • Karp's 21 NP-complete problems's has part is recorded as chromatic number[24].
  • Karp's 21 NP-complete problems's Freebase ID is recorded as /m/06d_qs[25].
  • Karp's 21 NP-complete problems's described by source is recorded as Reducibility among combinatorial problems[26].
  • Karp's 21 NP-complete problems's described by source is recorded as Karp Richard M.. Reducibility among combinatorial problems. Complexity of computer computations, Proceedings of a Symposium on the Complexity of Computer Computations, held March 20-22, 1972, at the IBM Thomas J. Watson Center, Yorktown Heights, New[27].

Body

Works and Contributions

Karp's 21 NP-complete problems is the creator of Richard M. Karp[3].

Why It Matters

Karp's 21 NP-complete problems draws 150 Wikipedia views per month (set category, ranking #7 of 16).[2] It has Wikipedia articles in 13 language editions, a strong signal of global cultural recognition.[28] It is known by 11 alternative names across languages and contexts.[29]

Related Entities

Richard M. Karp

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [4] ↑ . wikidata.org.
  2. [5] ↑ . wikidata.org.
  3. [6] ↑ . wikidata.org.
  4. [3] ↑ . wikidata.org.
  5. [7] ↑ . wikidata.org.
  6. [8] ↑ . wikidata.org.
  7. [9] ↑ . wikidata.org.
  8. [10] ↑ . wikidata.org.
  9. [11] ↑ . wikidata.org.
  10. [12] ↑ . wikidata.org.
  11. [13] ↑ . wikidata.org.
  12. [14] ↑ . wikidata.org.
  13. [15] ↑ . wikidata.org.
  14. [16] ↑ . wikidata.org.
  15. [17] ↑ . wikidata.org.
  16. [18] ↑ . wikidata.org.
  17. [19] ↑ . wikidata.org.
  18. [20] ↑ . wikidata.org.
  19. [21] ↑ . wikidata.org.
  20. [22] ↑ . wikidata.org.
  21. [23] ↑ . wikidata.org.
  22. [24] ↑ . wikidata.org.
  23. [25] ↑ . wikidata.org.
  24. [26] ↑ . wikidata.org.
  25. [27] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

Aggregate / graph-position facts

  1. [2] ↑ . Wikimedia Foundation. dumps.wikimedia.org.
  2. [28] ↑ . Wikidata sitelinks. wikidata.org.
  3. [29] ↑ . Wikidata aliases. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Karp's 21 NP-complete problems. Retrieved May 3, 2026, from https://4ort.xyz/entity/karp-s-21-np-complete-problems
MLA “Karp's 21 NP-complete problems.” 4ort.xyz Knowledge Graph, 4ort.xyz, 3 May. 2026, https://4ort.xyz/entity/karp-s-21-np-complete-problems.
BibTeX @misc{4ortxyz_karp-s-21-np-complete-problems_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Karp's 21 NP-complete problems}}, year = {2026}, url = {https://4ort.xyz/entity/karp-s-21-np-complete-problems}, note = {Accessed: 2026-05-03}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Karp's 21 NP-complete problems — https://4ort.xyz/entity/karp-s-21-np-complete-problems (retrieved 2026-05-03)

Canonical URL: https://4ort.xyz/entity/karp-s-21-np-complete-problems · Last refreshed: