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 (1,809 views/month).[2]
Key Facts
- NP-complete's instance of is recorded as complexity class[3].
- NP-complete is a type of computational problem[4].
- NP-complete is part of NP-hard[5].
- NP-complete is part of NP[6].
- NP-complete's Commons category is recorded as NP-complete problems[7].
- NP-complete comprises weak NP-completeness[8].
- NP-complete comprises strong NP-completeness[9].
- NP-complete's topic's main category is recorded as Category:NP-complete problems[10].
- NP-complete's facet of is recorded as P versus NP problem[11].
- NP-complete's Stack Exchange tag is recorded as https://cstheory.stackexchange.com/tags/np-complete[12].
- NP-complete's Stack Exchange tag is recorded as https://cs.stackexchange.com/tags/np-complete[13].
- NP-complete's Stack Exchange tag is recorded as https://stackoverflow.com/tags/np-complete[14].
- NP-complete's has characteristic is recorded as completeness[15].
- NP-complete's maintained by WikiProject is recorded as WikiProject Mathematics[16].
Body
Definition and Type
NP-complete's instance of is recorded as complexity class[3]. NP-complete is a type of computational problem[4].
Use and Application
Components include weak NP-completeness[8], a complexity class[17] and strong NP-completeness[9], a complexity class[18]. Part of include NP-hard[5], a complexity class[19] and NP[6], a complexity class[20].
Influence
Things named for NP-complete include Karp's 21 NP-complete problems[21], a set[22].
Why It Matters
NP-complete ranks in the top 3% of complexity_class entities by monthly Wikipedia readership (1,809 views/month).[2] NP-complete has Wikipedia articles in 25 language editions, a strong signal of global cultural recognition.[23] NP-complete is known by 37 alternative names across languages and contexts.[24]
Entities named for NP-complete include Karp's 21 NP-complete problems[21], a set[22].