NP-complete
0 sources
NP-complete
Summary
NP-complete is a complexity class[1]. NP-complete ranks in the top 3% of complexity_class entities by monthly Wikipedia readership (726 views/month).[2]
Key Facts
- NP-complete's image is recorded as P np np-complete np-hard.svg[3].
- NP-complete's instance of is recorded as complexity class[4].
- NP-complete's subclass of is recorded as computational problem[5].
- NP-complete's part of is recorded as NP-hard[6].
- NP-complete's part of is recorded as NP[7].
- NP-complete's Commons category is recorded as NP-complete problems[8].
- NP-complete's has part is recorded as weak NP-completeness[9].
- NP-complete's has part is recorded as strong NP-completeness[10].
- NP-complete's Freebase ID is recorded as /m/09tkl[11].
- NP-complete's topic's main category is recorded as Category:NP-complete problems[12].
- NP-complete's facet of is recorded as P versus NP problem[13].
- NP-complete's Stack Exchange tag is recorded as https://cstheory.stackexchange.com/tags/np-complete[14].
- NP-complete's Stack Exchange tag is recorded as https://cs.stackexchange.com/tags/np-complete[15].
- NP-complete's Stack Exchange tag is recorded as https://stackoverflow.com/tags/np-complete[16].
- NP-complete's has characteristic is recorded as completeness[17].
- NP-complete's MathWorld ID is recorded as NP-CompleteProblem[18].
- NP-complete's Open Library subject ID is recorded as np-complete_problems[19].
- NP-complete's Dictionary of Algorithms and Data Structures ID is recorded as npcomplete[20].
- NP-complete's maintained by WikiProject is recorded as WikiProject Mathematics[21].
- NP-complete's Microsoft Academic ID is recorded as 122749075[22].
- NP-complete's ProofWiki ID is recorded as Definition:NP-Complete[23].
- NP-complete's PlanetMath ID is recorded as NPcomplete[24].
- NP-complete's GitHub topic is recorded as np-completeness[25].
- NP-complete's Enciclopedia della Scienza e della Tecnica ID is recorded as problemi-np-completi[26].
- NP-complete's OpenAlex ID is recorded as C122749075[27].
Body
Works and Contributions
Things named for NP-complete include Karp's 21 NP-complete problems[28], a set[29].
Why It Matters
NP-complete ranks in the top 3% of complexity_class entities by monthly Wikipedia readership (726 views/month).[2] NP-complete has Wikipedia articles in 25 language editions, a strong signal of global cultural recognition.[30] NP-complete is known by 37 alternative names across languages and contexts.[31]
Entities named for NP-complete include Karp's 21 NP-complete problems[28], a set[29].