strong NP-completeness
property of computational problems that is a special case of NP-completeness
Facts
2 properties- Instance of
- complexity class
- Part of
- NP-complete[2]
🏷️ Also known as
en strong NP-completeness
es fuerte NP-completitud
es totalmente NP-completo
fa ان-پی کامل قوی
pl Problem jedynkowo NP zupełny
pl Problem jedynkowo NP-zupełny
pl Problem silnie NP zupełny
pl Problem silnie NP-zupełny
pl Silna NP-zupełność
pt Fortemente NP-completo
uk Строга NP-повнота
zh 强NP完全
🔖 Identifiers · 3
- Freebase ID
- /m/0g0vrx
- Microsoft Academic ID (discontinued)
- 94735162
- Topic's main category
- Category:Strongly NP-complete problems
Press Enter · cited answer in seconds
0 sources
Summary
strong NP-completeness is a complexity class[1].