NP-complete
complexity class
Facts
6 properties- Instance of
- complexity class
- Subclass of
- computational problem[2]
- Facet of
- P versus NP problem[7]
- Has characteristic
- completeness[8]
- Has part(s)
- weak NP-completeness, strong NP-completeness[5][6]
🏷️ Also known as
en NP-complete
en NPC
en nondeterministic polynomial time-complete
en CNP
en nondeterministic polynomial time-complete class
ar مسألة كثيرة حدود غير قطعية كاملة
cs NP-úplná úloha
cs NP úplnost
cs NP-úplný
cs NP-úplný problém
da NP-komplet
de NP-Vollständigkeit
de NP-vollständig
el NP-completeness
es Problema NP-completo
es Problemas NP completos
es NP-completitud
es Problema NP completo
es NP-completo
es NP completo
🔖 Identifiers · 15
- OpenAlex ID
- C122749075
- Image (Wikimedia Commons)
- P np np-complete np-hard.svg ↗
- Dictionary of Algorithms and Data Structures ID
- npcomplete
- Enciclopedia della Scienza e della Tecnica ID
- problemi-np-completi
- Encyclopedia of China (Third Edition) ID (2026)
- 2minu4
- Encyclopedia of China (Third Edition) old ID (2021)
- 207239
- Freebase ID
- /m/09tkl
- GitHub topic
- np-completeness
- MathWorld ID
- NP-CompleteProblem
- Microsoft Academic ID (discontinued)
- 122749075
- Open Library subject ID
- np-complete_problems
- PlanetMath ID
- NPcomplete
Show all 15 identifiers +3
- ProofWiki ID
- Definition:NP-Complete
- Stack Exchange tag
- cstheory.stackexchange.com, cs.stackexchange.com, stackoverflow.com
- Topic's main category
- Category:NP-complete problems
🔗 Connections
← Computational complexity 39
Examples 1
Facet of 1
Has part(s) 1
Has these parts 1
Instance of 1
Maintained by WikiProject 1
Named after 1
Subclass of 1
Topic's main category 1
← Category's main topic 1
← FactGrid item ID 1
← Is a list of 1
Press Enter · cited answer in seconds