NP-hard
0 sources
NP-hard
Summary
NP-hard is a complexity class[1]. NP-hard ranks in the top 2% of complexity_class entities by monthly Wikipedia readership (839 views/month).[2]
Key Facts
- NP-hard's instance of is recorded as complexity class[3].
- NP-hard's subclass of is recorded as computational problem[4].
- NP-hard's has part is recorded as NP-complete[5].
- NP-hard's has part is recorded as NP-equivalent[6].
- NP-hard's Freebase ID is recorded as /m/0f86q[7].
- NP-hard's topic's main category is recorded as Category:NP-hard problems[8].
- NP-hard's Encyclopædia Britannica Online ID is recorded as topic/NP-hard-problem[9].
- NP-hard's Stack Exchange tag is recorded as https://cs.stackexchange.com/tags/np-hard[10].
- NP-hard's Stack Exchange tag is recorded as https://stackoverflow.com/tags/np-hard[11].
- NP-hard's MathWorld ID is recorded as NP-HardProblem[12].
- NP-hard's Quora topic ID is recorded as NP-Hard-1[13].
- NP-hard's maintained by WikiProject is recorded as WikiProject Mathematics[14].
- NP-hard's Encyclopedia of China is recorded as 322923[15].
Why It Matters
NP-hard ranks in the top 2% of complexity_class entities by monthly Wikipedia readership (839 views/month).[2] NP-hard has Wikipedia articles in 19 language editions, a strong signal of global cultural recognition.[16] NP-hard is known by 19 alternative names across languages and contexts.[17]